The perfect matching problem is known to be in P, in randomizedNC, and it is hard forNL. 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 NC2, and counting and enumerating all perfect matchings is in NC3. 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 NC2. We extend the result to weig...
We investigate the space complexity of certain perfect matching problems over bipartite graphs embed...
We show that the problem of computing the number of perfect matchings in $K_{3,3}$-free graphs is i...
© Shafi Goldwasser and Ofer Grossman;. We present a pseudo-deterministic NC algorithm for finding pe...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
AbstractWe show that the problem of computing the number of perfect matchings in K3,3-free graphs is...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
A fundamental quest in the theory of computing is to understand the power of randomness. It is not k...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
The problem of devising an algorithm for counting the number of perfect matchings in bipartite graph...
The purpose of this paper is to introduce a new approach to the problem of computing perfect matchin...
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching p...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
Laszlo Lovasz recently posed the following problem: "Is there an NC algorithm for testing if a...
We investigate the space complexity of certain perfect matching problems over bipartite graphs embed...
We show that the problem of computing the number of perfect matchings in $K_{3,3}$-free graphs is i...
© Shafi Goldwasser and Ofer Grossman;. We present a pseudo-deterministic NC algorithm for finding pe...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
AbstractWe show that the problem of computing the number of perfect matchings in K3,3-free graphs is...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
A fundamental quest in the theory of computing is to understand the power of randomness. It is not k...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
The problem of devising an algorithm for counting the number of perfect matchings in bipartite graph...
The purpose of this paper is to introduce a new approach to the problem of computing perfect matchin...
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching p...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
Laszlo Lovasz recently posed the following problem: "Is there an NC algorithm for testing if a...
We investigate the space complexity of certain perfect matching problems over bipartite graphs embed...
We show that the problem of computing the number of perfect matchings in $K_{3,3}$-free graphs is i...
© Shafi Goldwasser and Ofer Grossman;. We present a pseudo-deterministic NC algorithm for finding pe...
Add to ORKG