The uniquely solvable bipartite matching problem
- 30 June 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (4), 221-224
- https://doi.org/10.1016/0167-6377(91)90062-t
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973