A O(|V|·|E|) algorithm for maximum matching of graphs
- 1 March 1974
- journal article
- Published by Springer Nature in Computing
- Vol. 12 (1), 91-98
- https://doi.org/10.1007/bf02239502
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A n5/2 algorithm for maximum matchings in bipartitePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- 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