A cubic Kernel for feedback vertex set and loop cutset

38Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Feedback Vertex Set problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. (Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp. 192-202, 2006), we show that this problem has a kernel with O(k3) vertices, i. e., there is a polynomial time algorithm, that given a graph G and an integer k, finds a graph G′ with O(k3) vertices and integer k′≤k, such that G has a feedback vertex set of size at most k, if and only if G′ has a feedback vertex set of size at most k′. Moreover, the algorithm can be made constructive: if the reduced instance G′ has a feedback vertex set of size k′, then we can easily transform a minimum size feedback vertex set of G′ into a minimum size feedback vertex set of G. This kernelization algorithm can be used as the first step of an FPT algorithm for Feedback Vertex Set, but also as a preprocessing heuristic for Feedback Vertex Set. We also show that the related Loop Cutset problem also has a kernel of cubic size. The kernelization algorithms are experimentally evaluated, and we report on these experiments. © 2009 The Author(s).

Cite

CITATION STYLE

APA

Bodlaender, H. L., & van Dijk, T. C. (2010). A cubic Kernel for feedback vertex set and loop cutset. Theory of Computing Systems, 46(3), 566–597. https://doi.org/10.1007/s00224-009-9234-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free