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

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 algorithm and the new parallel technique for the matching enumerator problem. The enumerator algorithm works in O(log3 n) parallel time and O(n3k+5.5 ¿ log n) processors. In the case of arbitrary bipartite graphs it yields an 'optimal' (up to the log n- factor) parallel time algorithm for enumerating all the perfect matchings in a graph. It entails also among other things an efficient NC3-algorithm for computing small (polynomially bounded) arithmetic permanents, and a sublinear parallel time algorithm for enumerating all the perfect matchings in graphs with permanents up to 2nε.

[1]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Vijay V. Vazirani,et al.  NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.

[3]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[4]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[5]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[6]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[7]  J. Hopcroft,et al.  Fast parallel matrix and GCD computations , 1982, FOCS 1982.

[8]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[9]  D. Helmbold,et al.  Two Processor Scheduling is in NC , 1987, SIAM J. Comput..

[10]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[11]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[12]  Richard J. Lipton,et al.  Pseudorandom Number Generation and Space Complexity , 1983, FCT.

[13]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[14]  Rüdiger Loos.  Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..

[15]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[16]  Richard J. Lipton,et al.  Pseudorandom Number Generation and Space Complexity , 1983, Inf. Control..

[17]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[18]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[19]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[20]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[21]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[22]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[23]  Howard J. Karloff.  A las vegas rnc algorithm for maximum matching , 1986, Comb..

[24]  Mihalis Yannakakis,et al.  Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs , 1988, ICALP.

[25]  Joachim von zur Gathen.  Permanent and determinant , 1987 .

[26]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[27]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[28]  Ernst W. Mayr,et al.  Two Processor Scheduling is in NC , 1986, Aegean Workshop on Computing.

[29]  Marek Karpinski,et al.  The Matching Problem for Strongly Chordal Graphs is in $NC$ , 1986 .

[30]  Vijay V. Vazirani,et al.  Maximum Matchings in General Graphs Through Randomization , 1989, J. Algorithms.

[31]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[32]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[33]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[34]  Lloyd R. Welch,et al.  Permanents of 0, 1-Matrices , 1974, J. Comb. Theory, Ser. A.