A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm
- 1 March 1994
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 14 (1), 71-109
- https://doi.org/10.1007/bf01305952
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new approach to maximum matching in general graphsPublished by Springer Nature ,2005
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- An O (N2.5) algorithm for maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- A O(|V|·|E|) algorithm for maximum matching of graphsComputing, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Modification of Edmonds' maximum matching algorithmJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957