Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs

Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs. SIAM Journal on Computing, 42(3):1392-1404, 2013. [doi]

No reviews for this publication, yet.