Algorithms solving the Matching Cut problem

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 i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 609; s. 328 - 335
Hlavní autori: Kratsch, Dieter, Le, Van Bang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 04.01.2016
Elsevier
Predmet:
Algorithms
Automatic
Engineering Sciences
Graph algorithm
Graph theory
Graphs
Matching
Matching cut
Matching cut
Graph algorithm
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.10.016