Abstract
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 NC2, and counting and enumerating all perfect matchings is in NC3. For general graphs with a polynomially bounded number of perfect matchings, they show both problems to be 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 weighted graphs. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Agrawal, M., Hoang, T. M., & Thierauf, T. (2007). The polynomially bounded perfect matching problem is in NC2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4393 LNCS, pp. 489–499). Springer Verlag. https://doi.org/10.1007/978-3-540-70918-3_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
