The Polynomially Bounded Perfect Matching Problem Is in NC2
The perfect matching problem is known to be in P, 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 2, and counting and enumerating all perfect matchings is in NC 3. For general graphs with a polynomially bounded number of perfect matchings, they show both problems to be in NC 3.
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 2. We extend the result to weighted graphs.
KeywordsBipartite Graph Perfect Match Weighted Graph Chordal Graph Counting Problem
Unable to display preview. Download preview PDF.
- [Dam91]Damm, C.: DET = L(#L). Technical Report Informatik-Preprint 8, Fachbereich Informatik der Humboldt-Universität zu Berlin (1991)Google Scholar
- [DK86]Dahlhaus, E., Karpinski, M.: The matching problem for strongly chordal graphs is in NC. Technical Report 855-CS, University of Bonn (1986)Google Scholar
- [GK87]Grigoriev, D., Karpinski, M.: The matching problem for bipartite graphs with polynomially bounded permanent is in NC. In: 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 166–172. IEEE Computer Society Press, Los Alamitos (1987)Google Scholar
- [Kas67]Kastelyn, P.W.: Graph theory and crystal physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)Google Scholar
- [MVV87]Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. In: 19th ACM Symposium on Theory of Computing, pp. 345–354. ACM Press, New York (1987)Google Scholar
- [Tod91]Toda, S.: Counting problems computationally equivalent to the determinant. Technical Report CSIM 91-07, Dept. of Computer Science and Information Mathematics, University of Electro-Communications, Chofu-shi, Tokyo 182, Japan (1991)Google Scholar
- [Val92]Valiant, L.: Why is boolean complexity theory difficult. In: Paterson, M.S. (ed.) Boolean Function Complexity. London Mathematical Society Lecture Notes Series, vol. 169, Cambridge University Press, Cambridge (1992)Google Scholar