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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 81; no. 1; pp. 186 - 207
Main Authors:	Kim, Eun Jung, Paul, Christophe, Philip, Geevarghese
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2015 Elsevier
Subjects:	[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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!