Affiliation:
1. Stanford University, Stanford, California
2. University of California, Irvine, California
Abstract
Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC perfect matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder than finding one (the former is #P-complete and the latter is in P), and on the other, for planar graphs, counting has long been known to be in NC whereas finding one has resisted a solution.
In this article, we give an NC algorithm for finding a perfect matching in a planar graph. Our algorithm uses the above-stated fact about counting perfect matchings in a crucial way. Our main new idea is an NC algorithm for finding a face of the perfect matching polytope at which a set (which could be polynomially large) of conditions, involving constraints of the polytope, are simultaneously satisfied. Several other ideas are also needed, such as finding, in NC, a point in the interior of the minimum-weight face of this polytope and finding a balanced tight odd set.
Funder
NSF
DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference34 articles.
1. Parallel computation for well-endowed rings and space-bounded probabilistic machines
2. Glencora Borradaile David Eppstein Amir Nayyeri and Christian Wulff-Nilsen. 2014. All-pairs minimum cuts in near-linear time for surface-embedded graphs. Arxiv Preprint Arxiv:1411.7055 (2014). Glencora Borradaile David Eppstein Amir Nayyeri and Christian Wulff-Nilsen. 2014. All-pairs minimum cuts in near-linear time for surface-embedded graphs. Arxiv Preprint Arxiv:1411.7055 (2014).
3. Fast Parallel Matrix Inversion Algorithms
4. J. Edmonds. 1965. Maximum matching and a polyhedron with 0 1-vertices. Journal of Research of the National Bureau of Standards B 69B (1965) 125--130. J. Edmonds. 1965. Maximum matching and a polyhedron with 0 1-vertices. Journal of Research of the National Bureau of Standards B 69B (1965) 125--130.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献