Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333869 | Theoretical Computer Science | 2016 | 8 Pages |
Abstract
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete. This paper provides a first branching algorithm solving Matching Cut in time Oâ(2n/2)=Oâ(1.4143n) for an n-vertex input graph, and shows that Matching Cut parameterized by the vertex cover number Ï(G) can be solved by a single-exponential algorithm in time 2Ï(G)O(n2). Moreover, the paper also gives a polynomially solvable case for Matching Cut which covers previous known results on graphs of maximum degree three, line graphs, and claw-free graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dieter Kratsch, Van Bang Le,