Perfect matchings in o(nlogn) time in regular bipartite graphs
Proceedings of the 42nd ACM symposium on Theory of computing - STOC ’10
Sanjeev Khanna
Ashish Goel
A near-linear time ?-approximation algorithm for geometric bipartite matching
A new approach to computing maximum flows using electrical flows