Abstract
We reduce the problem of finding an augmenting path in a general graph to a reachability problem and show that a slight modification of depth-first search leads to an algorithm for finding such paths. As a consequence, we obtain a straightforward algorithm for maximum matching in general graphs of time complexity O(√nm), where n is the number of nodes and m is the number of edges in the graph.
Cite
CITATION STYLE
Blum, N. (1990). A new approach to maximum matching in general graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 443 LNCS, pp. 586–597). Springer Verlag. https://doi.org/10.1007/bfb0032060
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
