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

@inproceedings{Kim2012ASF, title={A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem}, author={Eun Jung Kim and Christophe Paul and Geevarghese Philip}, booktitle={SWAT}, year={2012} }

Given an input graph G on n vertices and an integer k, the parameterized K4-minor cover problem asks whether there is a set S of at most k vertices whose deletion results in a K4-minor free graph or, equivalently, in a graph of treewidth at most 2. The problem can thus also be called Treewidth-2 Vertex Deletion. This problem is inspired by two well-studied parameterized vertex deletion problems, Vertex Cover and Feedback Vertex Set, which can be expressed as Treewidth-tVertex Deletion problems… CONTINUE READING

1

Twitter Mention

#### Supplemental Presentations

PRESENTATION SLIDES

A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## Planar F-Deletion: Approximation and Optimal FPT Algorithms

VIEW 1 EXCERPT

CITES METHODS

## Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 24 REFERENCES

## Improved algorithms for feedback vertex set problems

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Hitting and Harvesting Pumpkins

VIEW 1 EXCERPT

## Nearly optimal FPT algorithms for Planar-F-Deletion

VIEW 2 EXCERPTS

## Obtaining a Bipartite Graph by Contracting Few Edges

VIEW 1 EXCERPT

## Bidimensionality and kernels

VIEW 1 EXCERPT

## (Meta) Kernelization

VIEW 1 EXCERPT

## Cutset Sampling for Bayesian Networks

VIEW 1 EXCERPT