The matching problem for bipartite graphs with polynomially bounded permanents is in NC

@article{Grigoriev1987TheMP,
  title={The matching problem for bipartite graphs with polynomially bounded permanents is in NC},
  author={D. Grigoriev and M. Karpinski},
  journal={28th Annual Symposium on Foundations of Computer Science (sfcs 1987)},
  year={1987},
  pages={166-172}
}
  • D. Grigoriev, M. Karpinski
  • Published 1987
  • Mathematics, Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
It is shown that the problem of deciding and constructing a perfect matching in bipartite graphs G with the polynomial permanents of their n × n adjacency matrices A (perm(A) = nO(1)) are in the deterministic classes NC2 and NC3, respectively. We further design an NC3 algorithm for the problem of constructing all perfect matchings (enumeration problem) in a graph G with a permanent bounded by O(nk). The basic step was the development of a new symmetric functions method for the decision… Expand
Some perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding aExpand
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
TLDR
It is proved that finding an NC algorithm for perfect matching in slightly less dense graphs (minimum degree is at least (12 ? ?)|V|) is as hard as the same problem for all graphs, and interestingly the problem of finding a Hamiltonian cycle becomes NP-complete. Expand
The Matching Problem in General Graphs Is in Quasi-NC
  • O. Svensson, Jakub Tarnawski
  • Mathematics, Computer Science
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
It is shown that the perfect matching problem in general graphs is in Quasi-NC, and the result is obtained by a derandomization of the Isolation Lemma for perfect matchings to obtain a Randomized NC algorithm. Expand
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small
TLDR
It is remarkable that, circumventing the planarity, the same approach work for a non-planar subclass of biparitite graphs and the algorithm as well as its analysis become much simpler than the previously known algorithms for the same. Expand
The Polynomially Bounded Perfect Matching Problem Is in NC 2
TLDR
It is shown that for any graph that has a polynomially bounded number of perfect matchings, it is possible to construct allperfect matchings in NC2, and this result is extended to weighted graphs. Expand
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
TLDR
This work alters the algorithm of Gallucio and Loebl to show that counting the number of perfect matchings in graphs of small genus is in NC, and rekindles the hope for an NC-algorithm to find a perfect matching in a non-bipart i te planar graph. Expand
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
TLDR
It is proved that finding an NC algorithm for perfect matching in slightly less dense graphs is as hard as the same problem for all graphs, and the problem of finding a Hamiltonian cycle becomes NP-complete. Expand
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
TLDR
A deterministic Logspace procedure, which, given a bipartite planar graph on n vertices, assigns O(log n) bits long weights to its edges so that the minimum weight perfect matching in the graph becomes unique, and tries to find the lower bound on the number of bits needed for deterministically isolating a perfect matching. Expand
Perfect Bipartite Matching in Pseudo-Deterministic RNC
TLDR
The algorithm is the first algorithm to return unique perfect matchings with only polynomially many processors, and is also the first pseudo-deterministic RNC algorithm for depth first search (DFS). Expand
On the Matching Problem for Special Graph Classes
  • T. Hoang
  • Computer Science, Mathematics
  • 2010 IEEE 25th Annual Conference on Computational Complexity
  • 2010
TLDR
The present paper proves some new complexity bounds for various versions of problems related to perfect matchings in graphs with a polynomially bounded number of nice cycles. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 70 REFERENCES
Constructing a perfect matching is in random NC
We show that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i.e., the problem is solvable in polylog time by a randomized parallel algorithm using aExpand
Maximum Matchings in General Graphs Through Randomization
TLDR
A new randomized algorithm for the maximum matching problem is presented that is algebraic and works on the Tutte matrix of the given graph and the current best running time is O(m). Expand
A Taxonomy of Problems with Fast Parallel Algorithms
  • S. Cook
  • Mathematics, Computer Science
  • Inf. Control.
  • 1985
TLDR
An attempt is made to identify important subclasses of NC and give interesting examples in each subclass, and a new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph. Expand
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching
TLDR
The ideas developed may be a step towards obtaining an NC algorithm for determining if a graph has a perfect matching, and NC algorithms for obtaining a transitive orientation for a comparability graph, anad an interval representation for an interval graph are given. Expand
The complexity of approximate counting
TLDR
The complexity of computing approximate solutions to problems in #P is classified in terms of the polynomial-time hierarchy (for short, P-hierarchy) in order to study a class of restricted, but very natural, probabilistic sampling methods motivated by the particular counting problems. Expand
How hard is it to marry at random? (On the approximation of the permanent)
  • A. Broder
  • Computer Science, Mathematics
  • STOC '86
  • 1986
TLDR
Al though finding a perfect matching is easy and finding a Hamil tonian circuit is hard, counting perfect matchings and counting Hamiltonian circuits is equally hard, as hard as computing the number of solutions of any problem in NP. Expand
A new approach to the maximum flow problem
TLDR
By incorporating the dynamic tree data structure of Sleator and Tarjan, a version of the algorithm running in O(nm log(n'/m)) time on an n-vertex, m-edge graph is obtained, as fast as any known method for any graph density and faster on graphs of moderate density. Expand
A las vegas rnc algorithm for maximum matching
TLDR
The min-max formula for the size of a maximum matching is used to convert any Monte Carlo maximum matching algorithm into a Las Vegas (error-free) one and the resulting algorithm returns (with high probability) amaximum matching and a certificate proving that the matching is indeed maximum. Expand
Decomposition by clique separators
  • R. Tarjan
  • Computer Science, Mathematics
  • Discret. Math.
  • 1985
TLDR
An O( nm )-time algorithm for finding a decomposition of an n -vertex, m -edge graph is given and it is described how this decomposition can be used in divide-and-conquer algorithms for various graph problems, such as graph coloring and finding maximum independent sets. Expand
Characterizations of strongly chordal graphs
  • M. Farber
  • Computer Science, Mathematics
  • Discret. Math.
  • 1983
TLDR
Several characterizations of the class of strongly chordal graphs are presented, including a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices, which yields a polynomial recognition algorithm. Expand
...
1
2
3
4
5
...