V
by V skew-symmetric matrix , called the Tutte matrix, associated with a simple graph G=(V,E). He associates an indeterminate with each , then defines when , and otherwise. The rank of the Tutte matrix is exactly twice the size of a maximum matching of G. Using linear algebra and ideas from the Gallai–Edmonds decomposition, we describe a very simple yet efficient algorithm that replaces the indeterminates with constants without losing rank. Hence, by computing the rank of the resulting matrix, we can efficiently compute the size of a maximum matching of a graph.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 4, 1997
Rights and permissions
About this article
Cite this article
Geelen, J. An Algebraic Matching Algorithm. Combinatorica 20, 61–70 (2000). https://doi.org/10.1007/s004930070031
Issue Date:
DOI: https://doi.org/10.1007/s004930070031