Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 184-191
- https://doi.org/10.1007/11847250_17
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Exact Computation of Maximum Induced ForestLecture Notes in Computer Science, 2006
- Measure and conquerPublished by Association for Computing Machinery (ACM) ,2006
- Parameterized Complexity of Generalized Vertex Cover ProblemsLecture Notes in Computer Science, 2005
- An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set ProblemLecture Notes in Computer Science, 2005
- Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex SetLecture Notes in Computer Science, 2002
- On enumerating all minimal solutions of feedback problemsDiscrete Applied Mathematics, 2002
- Feedback Set ProblemsPublished by Springer Nature ,1999
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972