Abstract
In certain applications it is required to find in a bipartite graph a perfect matching which satisfies some additional properties. For one such type of restrictions the problem is proven to be NP-complete. If for a given subset of edges no more than r edges may be included in the matching then an O(ne) algorithm is suggested.
Finally, an efficient algorithm to find all perfect matchings is presented. It requires O(e) time per matching and a total of O(e) space. This algorithm may be used to calculate the permanent of a matrix.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.V.Aho, J.E.Hopcroft and J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley (1974).
C. Berge, "Graphs and Hypergraphs", North-Holland (1973).
E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1 (1959), 269–271.
J. Edmonds and R.M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. ACM, 19 (1972), 248–264.
S. Even, "Algorithmic Combinatorics", MacMillan (1973).
S. Even, A. Itai and A. Shamir, "On the Complexity of Timetable and Multi-Commodity Flow", SIAM J. on Computing, 5 (1976), 691–703.
C.R. Ford Jr. and D.R. Fulkerson, "Flows in Networks", Princeton University Press (1962).
S. Gal and Y. Breitbart, "A Method for Obtaining all the Solutions of a Perfect Matching Problem", IBM Israel Scientific Center TR-16 (1974).
J.E. Hopcroft and R.M. Karp, "An n 5/2 Algorithm for Maximum Matching in Bipartite Graphs", SIAM J. on Computing, 2 (1973), 225–231.
A. Itai and M. Rodeh, "Finding a Minimum Circuit in a Graph", Proc. of the 1977 ACM Symp. on Theory of Computing, Boulder, Colorado (May 1977).
L.L. Lang and J.D. Starkey, "An O(elogn) Shortest Path Algorithm for Sparse Graphs", Proc. on the Symp. on Algorithms and Complexity, Carnegie-Mellon University (April 1976).
J.R. Ryser, "Combinatorial Mathematics", The Mathematical Association of America, distributed by John Wiley & Sons (1963).
S.L. Tanimoto, "Analysis of Biomedical Images Using Maximal Matching", Proc. of the 1976 IEEE Conf. on Decision and Control Adaptive Processes, Clearwater Beach, Florida (Dec. 1976).
R.A. Wagner, "A Shortest Path Algorithm for Edge-Sparse Graphs", J. ACM, 23 (1976), 50–57.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itai, A., Rodeh, M. (1977). Some matching problems. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive