A single-exponential FPT algorithm for the K4-minor cover problem

Given a graph G and a parameter k∈N, the parameterized K4-minor cover problem asks whether at most k vertices can be deleted to turn G into a K4-minor-free graph, or equivalently in a graph of treewidth at most 2. This problem is inspired by two well-studied parameterized vertex deletion problems, V...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of computer and system sciences Ročník 81; číslo 1; s. 186 - 207
Hlavní autori:	Kim, Eun Jung, Paul, Christophe, Philip, Geevarghese
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2015 Elsevier
Predmet:	[formula omitted]-minor cover Computer Science Discrete Mathematics Fixed-parameter tractable algorithms Treewidth-2 Deletion Treewidth-2 Deletion Fixed-parameter tractable algorithms K4-minor cover FPT time Vertex Cover
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!