A fast algorithm for enumerating bipartite perfect matchings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 367-379

  Uno, Takeaki ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Enumerating algorithm; Enumeration; Perfect matching

Indexed keywords

BIPARTITE GRAPHS; ENUMERATING ALGORITHM; ENUMERATION; FAST ALGORITHMS; PERFECT MATCHING; PERFECT MATCHINGS;

ALGORITHMS; GRAPH THEORY;

COMPUTATION THEORY; ALGORITHMS;

EID: 33750470692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_32     Document Type: Conference Paper

References (5)

1. K. Fukuda and T. Matsui, "Finding All the Perfect Matchings in Bipartite Graphs," Appl. Math. Lett. 7, No. 1, 15-18 (1994). 367, 370
2. 5/2 Algorithm for Maximum Matching in Bipartite Graphs," SIAM J. Comp. 2, 225-231 (1973). 370
3. T. Uno, "Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs," Lecture Note in Computer Science 1350, Springer-Verlag, Algorithms and Computation, 92-101 (1997). 368, 378
4. T. Uno, "A New Approach for Speeding Up Enumeration Algorithms," Lecture Note in Computer Science 1533, Springer-Verlag, Algorithms and Computation, 287-296 (1998). 368
5. T. Uno, "A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases," Lecture Note in Computer Science 1627, Springer-Verlag, Computing and Combinatorics (Proceeding of COCOON99), 349-359, (1999) 368