Computing a maximum cardinality matching in a bipartite graph in time O(n1.5m log n
- 28 February 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (4) , 237-240
- https://doi.org/10.1016/0020-0190(91)90195-n
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973