skip to main content
research-article

Exact Perfect Matching in Complete Graphs

Published:27 April 2017Publication History
Skip Abstract Section

Abstract

A red-blue graph is a graph where every edge is colored either red or blue. The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of red edges. We show that for complete and bipartite complete graphs, the exact perfect matching problem is logspace equivalent to the perfect matching problem. Hence, an efficient parallel algorithm for perfect matching would carry over to the exact perfect matching problem for this class of graphs. We also report some progress in extending the result to arbitrary graphs.

References

  1. J. Edmonds. 1965. Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B: Mathematics and Mathematical Physics 69B, 125--130. Google ScholarGoogle ScholarCross RefCross Ref
  2. H.-F. Geerdes and J. Szabó. 2011. A Unified Proof for Karzanov’s Exact Matching Theorem. Technical Report QP-2011-02. Egerváry Research Group, Budapest, Hungary. http://bolyai.cs.elte.hu/egres/.Google ScholarGoogle Scholar
  3. R. Gurjar, A. Korwar, J. Messner, S. Straub, and T. Thierauf. 2011. Planarizing Gadgets for Perfect Matching Do Not Exist. Technical Report TR11-148. Electronic Colloquium on Computational Complexity (ECCC), Potsdam, Germany. (Revised version appears in proceedings of MFCS 2012.)Google ScholarGoogle Scholar
  4. R. M. Karp, E. Upfal, and A. Wigderson. 1986. Constructing a perfect matching is in random NC. Combinatorica 6, 1, 35--48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. V. Karzanov. 1987. Maximum matching of given weight in complete and complete bipartite graphs. Cybernetics and Systems Analysis 23, 1, 8--13. Google ScholarGoogle ScholarCross RefCross Ref
  6. K. Mulmuley, U. Vazirani, and V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1, 105--113. http://dx.doi.org/10.1007/BF02579206 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. H. Papadimitriou and M. Yannakakis. 1982. The complexity of restricted spanning tree problems. Journal of the ACM 29, 2, 285--309. DOI:http://dx.doi.org/10.1145/322307.322309 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. O. Reingold. 2008. Undirected connectivity in log-space. Journal of the ACM 55, 4, Article No. 17. DOI:http://dx.doi.org/10.1145/1391289.1391291 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Vollmer. 1999. Introduction to Circuit Complexity. Springer. Google ScholarGoogle ScholarCross RefCross Ref
  10. Tongnyoul Yi, Katta G. Murty, and Cosimo Spera. 2002. Matchings in colored bipartite networks. Discrete Applied Mathematics 121, 1--3, 261--277. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Yuster. 2012. Almost exact matchings. Algorithmica 63, 39--50. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Exact Perfect Matching in Complete Graphs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!