The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
A single-exponential FPT algorithm for the K_4-minor cover problem
[article]

2012
*
arXiv
*
pre-print

Given an input graph G and an integer k, the parameterized K_4-minor cover problem asks whether there is a set S of at most k vertices whose deletion results in a K_4-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, Vertex Cover and Feedback Vertex Set, which can also be expressed as Treewidth-t Vertex Deletion problems: t=0 for Vertex Cover and t=1 for Feedback Vertex Set. While a

arXiv:1204.1417v1
fatcat:3ygho6u2pzfihezc6tnq5cieva