A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching.
arXiv: Data Structures and Algorithms(2019)
摘要
We give an NC reduction from search to decision for the problem of finding a minimum weight perfect matching, provided edge weights are polynomially bounded. As a consequence, for settling the long-standing open problem of obtaining an NC perfect matching algorithm, it suffices to obtain an NC algorithm for the decision problem. We believe this new fact has qualitatively changed the nature of this open problem. difficulty of obtaining an NC perfect matching algorithm led researchers to study matching vis-a-vis clever relaxations of the class NC. In this vein, recently [GG15] gave a pseudo-deterministic RNC algorithm for finding a perfect matching in a bipartite graph, i.e., an RNC algorithm with the additional requirement that on the same graph, it should return the same (i.e., unique) perfect matching for almost all choices of random bits. A corollary of our reduction is an analogous algorithm for general graphs. Our reduction and algorithm build on [AV18], whose result used planarity of the input graph critically; in fact, in three different ways. The main challenge was to adapt these steps to general graphs by exploiting the leeway that we are seeking a pseudo-deterministic RNC, rather than an NC, algorithm.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络