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 a polynomial-bounded number of processors. We also show that several related problems lie in Random NC. These include: (i) Constructing a perfect matching of maximum weight in a graph whose edge weights are given in unary notation; (ii) Constructing a maximum-cardinality matching; (iii) Constructing a matching covering a set of vertices of maximum weight in a graph whose vertex weights are given in binary; (iv) Constructing a maximum s-t flow in a directed graph whose edge weights are given in unary.

[1]  Eli Upfal,et al.  N-processors graphs distributively achieve perfect matchings in O(log2N) beats , 1982, PODC '82.

[2]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[3]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[4]  W. T. Tutte.  The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[5]  Stephen A. Cook,et al.  An overview of computational complexity , 1983, CACM.

[6]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

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

[8]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, FCT.

[9]  Eli Upfal,et al.  Are search and decision programs computationally equivalent? , 1985, STOC '85.

[10]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

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

[12]  J. Edmonds.  Systems of distinct representatives and linear algebra , 1967 .

[13]  Vijay V. Vazirani,et al.  The two-processor scheduling problem is in R-NC , 1985, STOC '85.

[14]  Allan Borodin,et al.  Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).