WG '91 Proceedings of the 17th International Workshop
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Solving Connected Dominating Set Faster than 2 n
Algorithmica - Parameterized and Exact Algorithms
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Linear Kernel for Planar Connected Dominating Set
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding odd cycle transversals
Operations Research Letters
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
Parameterized Complexity
Hi-index | 5.23 |
We investigate a generalization of the classical Feedback Vertex Set (FVS) problem from the point of view of parameterized algorithms. Independent Feedback Vertex Set (IFVS) is the ''independent'' variant of the FVS problem and is defined as follows: given a graph G and an integer k, decide whether there exists F@?V(G), |F|@?k, such that G[V(G)@?F] is a forest and G[F] is an independent set; the parameter is k. Note that the similarly parameterized version of the FVS problem-where there is no restriction on the graph G[F]-has been extensively studied in the literature. The connected variant CFVS-where G[F] is required to be connected-has received some attention as well. The FVS problem easily reduces to the IFVS problem in a manner that preserves the solution size, and so any algorithmic result for IFVS directly carries over to FVS. We show that IFVS can be solved in O(5^kn^O^(^1^)) time, where n is the number of vertices in the input graph G, and obtain a cubic (O(k^3)) kernel for the problem. Note the contrast with the CFVS problem, which does not admit a polynomial kernel unless CoNP@?NP/Poly.