Problem Definition
Let \( { G=(V,E) } \) be an undirected graph, and let \( { n=|V| } \), \( { m=|E| } \). A matching in G is a subset \( { M \subseteq E } \), such that no two edges of M have a common endpoint. A perfect matching is a matching of cardinality \( { n/2 } \). The most basic matching related problems are: finding a maximum matching (i. e. a matching of maximum size) and, as a special case, finding a perfect matching if one exists. One can also consider the case where a weight function \( { w\colon E\rightarrow \mathbb{R} } \) is given and the problem is to find a maximum weight matching.
The maximum matching and maximum weight matching are two of the most fundamental algorithmic graph problems. They have also played a major role in the development of combinatorial optimization and algorithmics. An excellent account of this can be found in a classic monograph [10] by Lovász and Plummer devoted entirely to matching problems. A more up-to-date, but also more technical...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bunch, J., Hopcroft, J.: Triangular Factorization and Inversion by Fast Matrix Multiplication. Math. Comput. 125, 231–236 (1974)
Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing (STOC), 1987, pp. 1–6
Edmonds, J.: Paths, Trees, and Flowers. Canad. J. Math. 17, 449–467 (1965)
Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. J. ACM 38(4), 815–853 (1991)
Harvey, N.: Algebraic Structures and Algorithms for Matching and Matroid Problems. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006
Hopcroft, J.E., Karp, R.M.: An \( { O(n^{5/2}) } \) Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2, 225–231 (1973)
Karloff, H.: A Las Vegas RNC algorithm for maximum matching. Combinatorica 6, 387–391 (1986)
Karp, R., Upfal, E., Widgerson, A.: Constructing a perfect matching is in Random NC. Combinatorica 6, 35–48 (1986)
Lovász, L.: On Determinants, Matchings and Random Algorithms. In: Budach, L. (ed.) Fundamentals of Computation Theory, FCT'79, pp. 565–574. Akademie‐Verlag, Berlin (1979)
Lovász, L., Plummer, M.D.: Matching Theory. Akadémiai Kiadó – North Holland, Budapest (1986)
Micali, S., Vazirani, V.V.: An \( { O(\sqrt{V}E) } \) Algorithm for Finding Maximum Matching in General Graphs. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1980, pp. 17–27
Mucha, M., Sankowski, P.: Maximum Matchings via Gaussian Elimination. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004 pp. 248–255
Mucha, M., Sankowski, P.: Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica 45, 3–20 (2006)
Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing, pp. 345–354. ACM Press, New York (1987)
Rabin, M.O., Vazirani, V.V.: Maximum Matchings in General Graphs Through Randomization. J. Algorithms 10, 557–567 (1989)
Sankowski, P.: Processor Efficient Parallel Matching. In: Proceeding of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2005, pp. 165–170
Sankowski, P.: Weighted Bipartite Matching in Matrix Multiplication Time. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 274–285
Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Springer, Berlin Heidelberg (2003)
Vazirani, V.V.: A Theory of Alternating Paths and Blossoms for Proving Correctness of the \( { O(\sqrt{V}E) } \) Maximum Matching Algorithm. Combinatorica 14(1), 71–109 (1994)
Yuster, R., Zwick, U.: Maximum Matching in Graphs with an Excluded Minor. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Mucha, M. (2008). Maximum Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_225
Download citation
DOI: https://doi.org/10.1007/978-0-387-30162-4_225
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30770-1
Online ISBN: 978-0-387-30162-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering