Advertisement

Some matching problems

  • Alon Itai
  • Michael Rodeh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

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.

Keywords

Short Path Bipartite Graph Perfect Match Match Problem Conjunctive Normal Form 
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

  1. [AHU]
    A.V.Aho, J.E.Hopcroft and J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley (1974).Google Scholar
  2. [B]
    C. Berge, "Graphs and Hypergraphs", North-Holland (1973).Google Scholar
  3. [D]
    E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1 (1959), 269–271.Google Scholar
  4. [EK]
    J. Edmonds and R.M. Karp, "Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems", J. ACM, 19 (1972), 248–264.Google Scholar
  5. [E]
    S. Even, "Algorithmic Combinatorics", MacMillan (1973).Google Scholar
  6. [EIS]
    S. Even, A. Itai and A. Shamir, "On the Complexity of Timetable and Multi-Commodity Flow", SIAM J. on Computing, 5 (1976), 691–703.Google Scholar
  7. [FF]
    C.R. Ford Jr. and D.R. Fulkerson, "Flows in Networks", Princeton University Press (1962).Google Scholar
  8. [GB]
    S. Gal and Y. Breitbart, "A Method for Obtaining all the Solutions of a Perfect Matching Problem", IBM Israel Scientific Center TR-16 (1974).Google Scholar
  9. [HK]
    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.Google Scholar
  10. [IR]
    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).Google Scholar
  11. [LS]
    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).Google Scholar
  12. [R]
    J.R. Ryser, "Combinatorial Mathematics", The Mathematical Association of America, distributed by John Wiley & Sons (1963).Google Scholar
  13. [T]
    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).Google Scholar
  14. [W]
    R.A. Wagner, "A Shortest Path Algorithm for Edge-Sparse Graphs", J. ACM, 23 (1976), 50–57.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Alon Itai
    • 1
  • Michael Rodeh
    • 2
  1. 1.Technion, Israel Institute of TechnologyHaifaIsrael
  2. 2.IBM Israel Scientific CenterHaifaIsrael

Personalised recommendations