The Complexity of the Matching-Cut Problem
Finding a cut or finding a matching in a graph are so simple problems that they are hardly considered problems at all. In this paper, by means of a reduction from the NAE3SAT problem, we prove that combining these two problems together, i.e., finding a cut whose split edges are a matching is an NP-complete problem. It remains intractable even if we impose the graph to be simple (no multiple edges allowed) or its maximum degree to be k, with k ≽ 4. On the contrary, we give a linear time algorithm that computes a matching-cut of a series-parallel graph. It’s open whether the problem is tractable or not for planar graphs.
Unable to display preview. Download preview PDF.
- 6.M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97) volume 1353 of Lecture Notes Comput. Sci., pages 284–290. Springer-Verlag, 1997.Google Scholar
- 7.T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annu. ACM Sympos. Theory Comput., pages 216–226, 1978.Google Scholar