An efficient algorithm for the bipartite matching problem
- 31 January 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 23 (1) , 86-93
- https://doi.org/10.1016/0377-2217(86)90218-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Algorithm for the solution of the assignment problem for sparse matricesComputing, 1983
- A shortest augmenting path method for solving minimal perfect matching problemsNetworks, 1981
- Solving the Assignment Problem by RelaxationOperations Research, 1980
- The alternating basis algorithm for assignment problemsMathematical Programming, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972