Abstract
To reduce a graph problem to its planar version, a standard technique is to replace crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally that such a reduction is not possible for the perfect matching problem and also extend this to some other problems related to perfect matching. We further show that there is no planarizing gadget for the Hamiltonian cycle problem.
- K. Burke. 2012. Theoretical Computer Science Stack Exchange. Retrieved May 17, 2016, from http://cstheory. stackexchange.com/questions/9587.Google Scholar
- E. Dahlhaus, P. Hajnal, and M. Karpinski. 1993. On the parallel complexity of Hamiltonian cycles and matching problem in dense graphs. Journal of Algorithms 15, 367--384. Google Scholar
Digital Library
- E. Dahlhaus and M. Karpinski. 1998. Matching and multidimensional matching in chordal and strongly chordal graphs. Discrete Applied Mathematics 84, 79--91. DOI:http://dx.doi.org/10.1016/S0166- 218X(98)00006-7 Google Scholar
Digital Library
- S. Datta, R. Kulkarni, N. Limaye, and M. Mahajan. 2010b. Planarity, determinants, permanents, and (unique) matchings. ACM Transactions on Computation Theory 1, 3, Article No. 10. DOI:http://dx.doi.org/ 10.1145/1714450.1714453 Google Scholar
Digital Library
- S. Datta, R. Kulkarni, and S. Roy. 2010a. Deterministically isolating a perfect matching in bipartite planar graphs. Theory of Computing Systems 47, 3, 737--757. http://dx.doi.org/10.1007/s00224-009-9204-8 Google Scholar
Digital Library
- J. Edmonds. 1965. Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449--467.Google Scholar
Cross Ref
- H. N. Gabow, H. Kaplan, and R. E. Tarjan. 2001. Unique maximum matching algorithms. Journal of Algorithms 40, 2, 159--183. DOI:http://dx.doi.org/10.1006/jagm.2001.1167 Google Scholar
Digital Library
- M. R. Garey, D. S. Johnson, and L. Stockmeyer. 1976a. Some simplified NP-complete graph problems. Theoretical Computer Science 1, 3, 237--267.Google Scholar
Cross Ref
- M. R. Garey, D. S. Johnson, and R. E. Tarjan. 1976b. The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing 5, 4, 704--714.Google Scholar
Digital Library
- W. Gasarch. 2012. Is there a NICE gadget for showing PLANAR HC is NPC? Computational Complexity Blog. Retrieved May 17, 2016, from http://blog.computationalcomplexity.org/2012/01/is-there-nice-gadget-for-showing-planar.html.Google Scholar
- T. M. Hoang, M. Mahajan, and T. Thierauf. 2006. On the bipartite unique perfect matching problem. In Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 4051. Springer, 453--464. Google Scholar
Digital Library
- T. M. Hoang. 2010. On the matching problem for special graph classes. In Proceedings of the Conference on Computational Complexity. 139--150. DOI:http://dx.doi.org/10.1109/CCC.2010.21 Google Scholar
Digital Library
- J. Hopcroft and R. Karp. 1973. An n<sup>5/2</sup> algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 225--231.Google Scholar
Cross Ref
- D. Johnson. 2012. Comment to: Is there a NICE gadget for showing PLANAR HC is NPC?Computational Complexity Blog. http://blog.computationalcomplexity.org/2012/01/is-there-nice-gadget-for-showing-planar.html?showComment=1325864505803#c5063180797819792185.Google Scholar
- R. M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller, J. W. Thatcher, and J. D. Bohlinger (Eds.). Springer, 85--103. DOI:http://dx.doi.org/ 10.1007/978-1-4684-2001-2_9Google Scholar
- M. Karpinski and W. Rytter. 1998. Fast Parallel Algorithms for Graph Matching Problems. Oxford University Press. Google Scholar
Digital Library
- P. W. Kasteleyn. 1967. Graph theory and crystal physics. In Graph Theory and Theoretical Physics, F. Harary (Ed.). Academic Press, Cambridge, MA, 43--110.Google Scholar
- D. Kozen. 1991. The Design and Analysis of Algorithms. Springer. Google Scholar
Digital Library
- D. C. Kozen, U. V. Vazirani, and V. V. Vazirani. 1985. NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matchings. In Proceedings of the 5th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’85). Springer, 496--503. Google Scholar
Digital Library
- R. Kulkarni, M. Mahajan, and K. Varadarajan. 2008. Some perfect matchings and perfect half-integral matchings in NC. Chicago Journal of Theoretical Computer Science 2008, Article No. 4.Google Scholar
- G. Lev, M. Pippenger, and L. Valiant. 1981. A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers 30, 93--100. Google Scholar
Digital Library
- L. Lovasz and M. D. Plummer. 1986. Matching Theory. Annals of Discrete Mathematics. North-Holland.Google Scholar
- M. Mahajan and K. R. Varadarajan. 2000. A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC’00). ACM, New York, NY, 351--357. Google Scholar
Digital Library
- S. Micali and V. Vazirani. 1980. An O(&sqrt||υ|· |E|) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS’80). 17--27. Google Scholar
Digital Library
- G. L. Miller and J. S. Naor. 1995. Flow in planar graphs with multiple sources and sinks. SIAM Journal on Computing 24, 1002--1017. http://dx.doi.org/10.1137/S0097539789162997 Google Scholar
Digital Library
- 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
- L. Valiant. 1979. The complexity of computing the permanent. Theoretical Computer Science 8, 189--201.Google Scholar
Cross Ref
- V. Vazirani. 1989. NC algorithms for computing the number of perfect matchings in K<sub>3, 3</sub>-free graphs and related problems. Information and Computing 80, 22, 152--164. Google Scholar
Digital Library
- V. Vazirani. 1994. A theory of alternating paths and blossoms for proving correctness of the O(&sqrtV E) general graph maximum matching algorithm. Combinatorica 14, 71--109.Google Scholar
Cross Ref
- R. Yuster. 2012. Almost exact matchings. Algorithmica 63, 1--2, 39--50. http://dx.doi.org/10.1007/s00453- 011-9519-0Google Scholar
Cross Ref
Index Terms
Planarizing Gadgets for Perfect Matching Do Not Exist
Recommendations
Exact Perfect Matching in Complete Graphs
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 ...
Planarizing gadgets for perfect matching do not exist
MFCS'12: Proceedings of the 37th international conference on Mathematical Foundations of Computer ScienceTo reduce a graph problem to its planar version, a standard technique is to replace crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally that such a reduction is not possible for the perfect matching problem and also ...
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 ...






Comments