Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
Using randomized sparsification to approximate minimum cuts
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Cut structures and randomized algorithms in edge-connectivity problems
Cut structures and randomized algorithms in edge-connectivity problems
Switch Scheduling via Randomized Edge Coloring
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Perfect matchings in o(n log n) time in regular bipartite graphs
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn), dates back to König's work in 1916 (here m = nd is the number of edges in the graph, 2n is the number of vertices, and d is the degree of each node). The currently most efficient algorithm takes time O(m), and is due to Cole, Ost, and Schirra. We improve this running time to O(min{m, n2.5ln n/d}); this minimum can never be larger than O(n1.75√ln n). We obtain this improvement by proving a uniform sampling theorem: if we sample each edge in a d-regular bipartite graph independently with a probability p = O(n ln n/d2) then the resulting graph has a perfect matching with high probability. The proof involves a decomposition of the graph into pieces which are guaranteed to have many perfect matchings but do not have any small cuts. We then establish a correspondence between potential witnesses to non-existence of a matching (after sampling) in any piece and cuts of comparable size in that same piece. Karger's sampling theorem for preserving cuts in a graph can now be adapted to prove our uniform sampling theorem for preserving perfect matchings. Using the O(m√n) algorithm (due to Hopcroft and Karp) for finding maximum matchings in bipartite graphs on the sampled graph then yields the stated running time. We also provide an infinite family of instances to show that our uniform sampling result is tight up to poly-logarithmic factors (in fact, up to ln2 n).