Affiliation:
1. University of South Carolina
2. Aalen University, Germany
Abstract
The perfect matching problem has a randomized NC-algorithm based on the Isolation Lemma of Mulmuley, Vazirani and Vazirani. We give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs. This gives us a deterministic quasi-NC-algorithm for the bipartite perfect matching problem.
The outline presented here emphasizes a geometric point of view. We think that this will be useful also for the perfect matching problem in general graphs.
Publisher
Association for Computing Machinery (ACM)
Reference13 articles.
1. Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
2. Matching and multidimensional matching in chordal and strongly chordal graphs
3. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
4. Jack Edmonds. Paths trees and owers. Canadian Journal of Mathematics 17:449467 1965. 10.4153/CJM-1965-045-4 Jack Edmonds. Paths trees and owers. Canadian Journal of Mathematics 17:449467 1965. 10.4153/CJM-1965-045-4
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献