A deterministic parallel algorithm for bipartite perfect matching
A deterministic parallel algorithm for bipartite perfect matching
复制标题
一种确定性并行二分完美匹配算法
DOI:
10.1145/3306208
复制
发表时间:
2019
影响因子:
22.7
通讯作者:
Thomas Thierauf
中科院分区:
文献类型:
--
作者:
Stephen A. Fenner;Rohit Gurjar;Thomas Thierauf
A fundamental quest in the theory of computing is to understand the power of randomness. It is not known whether every problem with an efficient randomized algorithm also has one that does not use randomness. One of the extensively studied problems under this theme is that of perfect matching. The perfect matching problem has a randomized parallel (NC) algorithm based on the Isolation Lemma of Mulmuley, Vazirani, and Vazirani. It is a long-standing open question whether this algorithm can be derandomized. In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs. This gives us a deterministic parallel (quasi-NC) algorithm for the bipartite perfect matching problem.Derandomization of the Isolation Lemma means that we deterministically construct a weight assignment so that the minimum weight perfect matching is unique. We present three different ways of doing this construction with a common main idea.
登录
查看更多内容
DOI:
10.1016/s0166-218x(98)00006-7
发表时间:
1998
期刊:
Discret. Appl. Math.
影响因子:
--
作者:
E. Dahlhaus;Marek Karpinski
通讯作者:
Marek Karpinski
DOI:
10.1016/0020-0190(94)00202-a
发表时间:
1995
期刊:
Inf. Process. Lett.
影响因子:
--
作者:
A. Subramanian
通讯作者:
A. Subramanian
DOI:
--
发表时间:
2017
期刊:
SIGA
影响因子:
--
作者:
Stephen A. Fenner;R. Gurjar;T. Thierauf
通讯作者:
T. Thierauf
DOI:
10.1016/j.ic.2012.03.002
发表时间:
2012
期刊:
Electron. Colloquium Comput. Complex.
影响因子:
--
作者:
Raghunath Tewari;N. V. Vinodchandran
通讯作者:
N. V. Vinodchandran
DOI:
10.1145/2897518.2897564
发表时间:
2016
期刊:
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
影响因子:
--
作者:
Stephen A. Fenner;Rohit Gurjar;Thomas Thierauf
通讯作者:
Thomas Thierauf