Skip to main content
SpringerLink
Log in

Maximum matchings in planar graphs via gaussian elimination

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n ω/2), whereω is the exponent of the best known matrix multiplication algorithm. Sinceω<2.38, this algorithm breaks through theO(n 1.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm for generating perfect matchings in planar graphs uniformly at random usingO(n ω/2) arithmetic operations. Our algorithms are based on the Gaussian elimination approach to maximum matchings introduced in [16].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blum, N.: A new approach to maximum matching in general graphs. In:Proc. 17th ICALP, Volume 443 of LNCS, Springer-Verlag, Berlin, 1990, pp. 586–597.

    Google Scholar 

  2. Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication.Math. Comp. 28 (1974), 231–236.

    Article  MATH  MathSciNet  Google Scholar 

  3. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In:Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, ACM Press, New York, 1987, pp. 1–6.

    Chapter  Google Scholar 

  4. Edmonds, J.: Paths, trees and flowers.Canad. J. Math. 17 (1965), 449–467.

    MATH  MathSciNet  Google Scholar 

  5. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems.J. ACM 38 (1991), 815–853.

    Article  MATH  MathSciNet  Google Scholar 

  6. Harary, F., editor:Graph Theory and Theoretical Physics. Academic Press, New York, 1967.

    MATH  Google Scholar 

  7. Khaira, M.S., Miller, G.L., Sheffler, T.J.: Nested dissection: a survey, Technical Report CS-92-106, 1992.

  8. Klein, P., Rao, S., Rauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In:Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1994, pp. 27–37.

    Chapter  Google Scholar 

  9. Kowalewski, G.:Einfuhrung in die Determinanten Theorie. Leipzig Verlag von Veit & Co, Leipzig, 1909.

    Google Scholar 

  10. Lipton, R.J., Rose, D.J., Tarjan, R.: Generalized nested dissection.SIAM J. Numer. Anal. 16 (1979), 346–358.

    Article  MATH  MathSciNet  Google Scholar 

  11. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs.SIAM J. Appl. Math. 36 (1979), 177–189.

    Article  MATH  MathSciNet  Google Scholar 

  12. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem.SIAM J. Comput. 9 (1980), 615–627.

    Article  MATH  MathSciNet  Google Scholar 

  13. Lovász, L.: On determinants, matchings and random algorithms. In Budach, L., ed.:Fundamentals of Computation Theory, Akademie-Verlag, Berlin, 1979, pp. 565–574.

    Google Scholar 

  14. Micali, S., Vazirani, V.V.: Ano(√|V||e|) algorithm for finding maximum matching in general graphs. In:Proceedings of the Twenty-First Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 17–27.

  15. Miller, G.L., Naor, J.: Flow in planar graphs with multiple sources and sinks. In:Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 112–117.

  16. Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In:Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 248–255.

  17. Pan, V.Y., Reif, J.H.: Fast and efficient parallel solution of sparse linear systems.SIAM J. Comput. 22 (1993), 1227–1250.

    Article  MATH  MathSciNet  Google Scholar 

  18. Rabin, M.O., Vazirani, V.V.: Maximum matchings in general graphs through randomization.J. Algorithms 10 (1989), 557–567.

    Article  MATH  MathSciNet  Google Scholar 

  19. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities.J. ACM 27 (1980), 701–717.

    Article  MATH  Google Scholar 

  20. Strassen, V.: Gaussian elimination is not optimal.Numer. Math. 13 (1969), 354–356.

    Article  MATH  MathSciNet  Google Scholar 

  21. Tutte, W.T.: The factorization of linear graphs.J. London Math. Soc. 22 (1947), 107–111.

    Article  MATH  MathSciNet  Google Scholar 

  22. Wilson, D.B.: Determinant algorithms for random planar structures. In:Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997, pp. 258–267.

    Google Scholar 

  23. Zippel, R.: Probabilistic algorithms for sparse polynomials. In:International Symposium on Symbolic and Algebraic Computation, Volume 72 of LNCS, Springer-Verlag, Berlin, 1979, pp. 216–226.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Marcin Mucha & Piotr Sankowski

Authors
  1. Marcin Mucha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Sankowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Mucha.

Additional information

This research was supported by KBN Grant 4T11C04425.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mucha, M., Sankowski, P. Maximum matchings in planar graphs via gaussian elimination. Algorithmica 45, 3–20 (2006). https://doi.org/10.1007/s00453-005-1187-5

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1187-5

Key Words

Search

Navigation