A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs.

Varsha Dani, Thomas P. Hayes

Browse the full SODA paper archive.