Document Open Access Logo

Extending Search Phases in the Micali-Vazirani Algorithm

Authors Michael Huang, Clifford Stein



PDF
Thumbnail PDF

File

LIPIcs.SEA.2017.10.pdf
  • Filesize: 2.03 MB
  • 19 pages

Document Identifiers

Author Details

Michael Huang
Clifford Stein

Cite AsGet BibTex

Michael Huang and Clifford Stein. Extending Search Phases in the Micali-Vazirani Algorithm. In 16th International Symposium on Experimental Algorithms (SEA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 75, pp. 10:1-10:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.SEA.2017.10

Abstract

The Micali-Vazirani algorithm is an augmenting path algorithm that offers the best theoretical runtime of O(n^{0.5} m) for solving the maximum cardinality matching problem for non-bipartite graphs. This paper builds upon the algorithm by focusing on the bottleneck caused by its search phase structure and proposes a new implementation that improves efficiency by extending the search phases in order to find more augmenting paths. Experiments on different types of randomly generated and real world graphs demonstrate this new implementation's effectiveness and limitations.
Keywords
  • matching
  • graph algorithm
  • experimental evaluation
  • non-bipartite

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Holger Bast, Kurt Mehlhorn, Guido Schafer, and Hisao Tamaki. Matching algorithms are fast in sparse random graphs. Theory of Computing Systems, 39(1):3-14, 2006. Google Scholar
  2. Steven T. Crocker. An experimental comparison of two maximum cardinality matching programs. In Catherine C. McGeoch David S. Johnson, editor, Network Flows and Matching: First DIMACS Implementation Challenge, volume 12 of Discrete Mathematics and Theoretical Computer Science, pages 519-537, 1993. Google Scholar
  3. Jack Edmonds. Paths, trees, and flowers. Canadian Journal of mathematics, 17(3):449-467, 1965. Google Scholar
  4. Shimon Even and Oded Kariv. An O(n^2.5) algorithm for maximum matching in general graphs. In Foundations of Computer Science, 1975., 16th Annual Symposium on, pages 100-112. IEEE, 1975. Google Scholar
  5. Harold N. Gabow. An efficient implementation of Edmonds' algorithm for maximum matching on graphs. Journal of the ACM (JACM), 23(2):221-234, 1976. Google Scholar
  6. Harold N. Gabow. Set-merging for the Matching Algorithm of Micali and Vazirani. arXiv preprint arXiv:1501.00212, 2014. Google Scholar
  7. Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. Exploring network structure, dynamics, and function using NetworkX. In Proceedings of the 7th Python in Science Conference (SciPy2008), pages 11-15, Pasadena, CA USA, August 2008. Google Scholar
  8. John E. Hopcroft and Richard M. Karp. A n^5/2 algorithm for maximum matchings in bipartite. In Switching and Automata Theory, 1971., 12th Annual Symposium on, pages 122-125. IEEE, 1971. Google Scholar
  9. T. Kameda and I. Munro. A O(|V|⋅|E|) algorithm for maximum matching of graphs. Computing, 12(1):91-98, 1974. Google Scholar
  10. John D. Kececioglu and A. Justin Pecqueur. Computing maximum-cardinality matchings in sparse general graphs. In Algorithm Engineering, pages 121-132, 1998. Google Scholar
  11. Eugene L. Lawler. Combinatorial optimization, 1976. Google Scholar
  12. Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection, jun 2014. URL: http://snap.stanford.edu/data.
  13. Jakob Magun. Greeding matching algorithms, an experimental study. J. Exp. Algorithmics, 3, sep 1998. URL: http://dx.doi.org/10.1145/297096.297131.
  14. R. Bruce Mattingly and Nathan P. Ritchey. Implementing an o(sqrtNm) cardinality matching algorithm. In Catherine C. McGeoch David S. Johnson, editor, Network Flows and Matching: First DIMACS Implementation Challenge, volume 12 of Discrete Mathematics and Theoretical Computer Science, pages 539-556, 1993. Google Scholar
  15. Silvio Micali and Vijay V. Vazirani. An O(√| V|⋅| E|) algoithm for finding maximum matching in general graphs. In Foundations of Computer Science, 1980, 21st Annual Symposium on, pages 17-27. IEEE, 1980. Google Scholar
  16. Vijay V. Vazirani. An improved definition of blossoms and a simpler proof of the MV matching algorithm. CoRR, abs/1210.4594, 2012. URL: http://arxiv.org/abs/1210.4594.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail