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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.