The Polynomially Bounded Perfect Matching Problem Is in NC 2
نویسندگان
چکیده
The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent open questions in complexity theory regarding parallel computations. Grigoriev and Karpinski [GK87] studied the perfect matching problem for bipartite graphs with polynomially bounded permanent. They showed that for such bipartite graphs the problem of deciding the existence of a perfect matchings is in NC, and counting and enumerating all perfect matchings is in NC. For general graphs with a polynomially bounded number of perfect matchings, they show both problems to be in NC. In this paper we extend and improve these results. We show that for any graph that has a polynomially bounded number of perfect matchings, we can construct all perfect matchings in NC. We extend the result to weighted graphs.
منابع مشابه
Planar Perfect Matching is in NC
Consider a planar graph G = (V,E) with polynomially bounded edge weight function w : E → [0, poly(n)]. The main results of this paper are NC algorithms for the following problems: • minimum weight perfect matching in G, • maximum cardinality and maximum weight matching in G when G is bipartite, • maximum multiple-source multiple-sink flow in G where c : E → [1, poly(n)] is a polynomially bounde...
متن کاملNC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs
In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in K3,3-minor-free graphs by building on Kasteleyn’s scheme for planar graphs, and stated that this “opens up the possibility of obtaining an NC algorithm for finding a perfect matching in K3,3-free graphs.” In this paper, we finally settle this 30-year-old open problem. Building on the recent breakthrough resu...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملPolynomially bounded solutions of the Loewner differential equation in several complex variables
We determine the form of polynomially bounded solutions to the Loewner differential equation that is satisfied by univalent subordination chains of the form $f(z,t)=e^{int_0^t A(tau){rm d}tau}z+cdots$, where $A:[0,infty]rightarrow L(mathbb{C}^n,mathbb{C}^n)$ is a locally Lebesgue integrable mapping and satisfying the condition $$sup_{sgeq0}int_0^inftyleft|expleft{int_s^t [A(tau)...
متن کاملPerfect Bipartite Matching in Pseudo-Deterministic RNC
In this paper we present a pseudo-deterministic RNC algorithm for finding perfect matchings in bipartite graphs. Specifically, our algorithm is a randomized parallel algorithm which uses poly(n) processors, poly(log n) depth, poly(log n) random bits, and outputs for each bipartite input graph a unique perfect matching with high probability. That is, it returns the same matching for almost all r...
متن کامل