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.
- 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 Scholar
Cross Ref
- 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 Scholar
- 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 Scholar
- R. M. Karp, E. Upfal, and A. Wigderson. 1986. Constructing a perfect matching is in random NC. Combinatorica 6, 1, 35--48. Google Scholar
Digital Library
- A. V. Karzanov. 1987. Maximum matching of given weight in complete and complete bipartite graphs. Cybernetics and Systems Analysis 23, 1, 8--13. Google Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- H. Vollmer. 1999. Introduction to Circuit Complexity. Springer. Google Scholar
Cross Ref
- Tongnyoul Yi, Katta G. Murty, and Cosimo Spera. 2002. Matchings in colored bipartite networks. Discrete Applied Mathematics 121, 1--3, 261--277. Google Scholar
Digital Library
- R. Yuster. 2012. Almost exact matchings. Algorithmica 63, 39--50. Google Scholar
Digital Library
Index Terms
Exact Perfect Matching in Complete Graphs
Recommendations
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05: Proceedings of the 10th Panhellenic conference on Advances in InformaticsIn this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect matching, the solution to the problem is the entire graph. We establish a ...
Perfect Matchings in Total Domination Critical Graphs
A graph is total domination edge-critical if the addition of any edge decreases the total domination number, while a graph with minimum degree at least two is total domination vertex-critical if the removal of any vertex decreases the total domination ...
Anti-forcing numbers of perfect matchings of graphs
We define the anti-forcing number of a perfect matching M of a graph G as the minimal number of edges of G whose deletion results in a subgraph with a unique perfect matching M , denoted by a f ( G , M ) . The anti-forcing number of a graph proposed by ...






Comments