A Fast Algorithm for Enumerating Bipartite Perfect Matchings

Authors:
Takeaki Uno
Affiliations:
Foundations of Informatics Research Division, National Institute of Informatics, Tokyo, Japan 101-8430
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2009

Citing 0
Cited 3

Approximating the Interval Constrained Coloring Problem

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Maximizing lifetime of sensor-target surveillance in wireless sensor networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Finding all maximally-matchable edges in a bipartite graph

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.