The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Perfect Matchings in Õ(n^1.5) Time in Regular Bipartite Graphs
[article]
2009
arXiv
pre-print
We consider the well-studied problem of finding a perfect matching in d-regular bipartite graphs with 2n vertices and m = nd edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes O(m √(n)) time, in regular bipartite graphs, a perfect matching is known to be computable in O(m) time. Very recently, the O(m) bound was improved to O({m, n^2.5 n/d}) expected time, an expression that is bounded by Õ(n^1.75). In this paper, we further improve this result
arXiv:0902.1617v2
fatcat:6fci7uvdrjgblbjdga63yrwgpy