A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
[chapter]

2012
*
Lecture Notes in Computer Science
*

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

doi:10.1007/978-3-642-31155-0_11
fatcat:gqnrcyxuvnbzdk32fujb3bguna