An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- 1 December 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 2 (4) , 225-231
- https://doi.org/10.1137/0202019
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- Distinct representatives of subsetsBulletin of the American Mathematical Society, 1948