Finding all minimum‐cost perfect matchings in Bipartite graphs
- 1 August 1992
- Vol. 22 (5) , 461-468
- https://doi.org/10.1002/net.3230220504
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Algorithms for finding K-best perfect matchingsDiscrete Applied Mathematics, 1987
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955