Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs

Takeaki Uno. Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. In Hon Wai Leong, Hiroshi Imai, Sanjay Jain, editors, Algorithms and Computation, 8th International Symposium, ISAAC 97, Singapore, December 17-19, 1997, Proceedings. Volume 1350 of Lecture Notes in Computer Science, pages 92-101, Springer, 1997.

Abstract

Abstract is missing.