Finding all the perfect matchings in bipartite graphs
- 1 January 1994
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 7 (1) , 15-18
- https://doi.org/10.1016/0893-9659(94)90045-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Finding all minimum‐cost perfect matchings in Bipartite graphsNetworks, 1992
- Algorithms for finding K-best perfect matchingsDiscrete Applied Mathematics, 1987
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- 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