The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 192-202
- https://doi.org/10.1007/11847250_18
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS*Computational Intelligence, 2005
- An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set ProblemLecture Notes in Computer Science, 2005
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- Bounded Fixed-Parameter Tractability and log2 n Nondeterministic BitsLecture Notes in Computer Science, 2004
- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) StepsLecture Notes in Computer Science, 2004
- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex CoverLecture Notes in Computer Science, 2004
- Randomized Algorithms for the Loop Cutset ProblemJournal of Artificial Intelligence Research, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set ProblemSIAM Journal on Discrete Mathematics, 1999
- ON DISJOINT CYCLESInternational Journal of Foundations of Computer Science, 1994