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

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Ashish Goel, Michael Kapralov, Sanjeev Khanna
• Keywords: CORR 2008, Education, Non-trivial Algorithm, Regular Bipartite Graph, Well-studied Problem