Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STACS

2007

Springer

2007

Springer

In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, when given a graph G and an integer k, ﬁnds a graph H and integer k ≤ k, such that H has a feedback vertex set with at most k vertices, if and only if G has a feedback vertex set with at most k vertices, and H has at most O(k3 ) vertices and edges. This improves upon a result by Burrage et al. [8] who gave a kernel for Feedback Vertex Set of size O(k11 ). One can easily make the algorithm constructive, and transform a minimum size feedback vertex set of H with at most k vertices into a minimum size feedback vertex set of G. The kernelization algorithm can be used as a ﬁrst step of an FPT algorithm for Feedback Vertex Set, but also as a preprocessing heuristic for the problem.

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
STACS |

Authors |
Hans L. Bodlaender |

Comments (0)