A Fast Algorithm for Enumerating Bipartite Perfect Matchings
Author:
- 4 December 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 367-379
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases1999
- New Approach for Speeding Up Enumeration AlgorithmsLecture Notes in Computer Science, 1998
- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs1997
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, 1994
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973