11 citations · 22 across the 11 of their papers we have counts for
1 paper · 1 filter
Ashish Goel, Michael Kapralov, Sanjeev Khanna
In this paper we consider the well-studied problem of finding a perfect matching in a d-regular bipartite graph on 2n nodes with m=nd edges. The best-known algorithm for general bi…