论文信息 - A Fast Algorithm for Enumerating Bipartite Perfect Matchings

A Fast Algorithm for Enumerating Bipartite Perfect Matchings

In this paper, we propose an algorithm for enumerating all the perfect matchings included in a given bipartite graph G = (V,E). The algorithm is improved by the approach which we proposed at ISAAC98. Our algorithm takes O(log |V|) time per perfect matching while the current fastest algorithm takes O(|V|) time per perfect matching.

Takeaki Uno

[1] Takeaki Uno. A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases , 1999, COCOON.

[2] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3] Takeaki Uno. A New Approach for Speeding Up Enumeration Algorithms , 1998, ISAAC.

[4] K. Fukuda,et al. Finding All The Perfect Matchings in Bipartite Graphs , 1989 .

[5] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6] Takeaki Uno,et al. Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs , 1997, ISAAC.