Sciweavers

Share
CORR
2008
Springer

Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs

8 years 3 months ago
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn), dates back to K
Ashish Goel, Michael Kapralov, Sanjeev Khanna
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Ashish Goel, Michael Kapralov, Sanjeev Khanna
Comments (0)
books