Finding a minimum feedback vertex set in time O(1.7548n)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 184-191

  Fomin, Fedor V ^a   Gaspers, Serge ^a   Pyatkin, Artem V ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Exact exponential algorithm; Maximum induced forest; Minimum feedback vertex set

Indexed keywords

FEEDBACK; GRAPH THEORY;

EXACT EXPONENTIAL ALGORITHMS; MAXIMUM INDUCED FOREST; MINIMUM FEEDBACK VERTEX SETS;

SET THEORY;

EID: 33750238491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_17     Document Type: Conference Paper

References (8)

1. 3) FPT algorithm for the undirected feedback vertex set problem., in Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON 2005), vol. 3595 of LNCS, Berlin, 2005, Springer, pp. 859-869.
2. P. FESTA, P. M. PARDALOS, AND M. G. C. RESENDE, Feedback set problems, in Handbook of combinatorial optimization, Supplement Vol. A, Kluwer Acad. Publ., Dordrecht, 1999, pp. 209-258.
3. 0.288n) independent set algorithm, in 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), New York, 2006, ACM and SIAM, pp. 18-25.
4. J. Guo, R. NIEDERMEIER, AND S. WERNICKE, Parameterized complexity of generalized vertex cover problems., in Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS 2005), vol. 3608 of LNCS, Springer, Berlin, 2005, pp. 36-48.
5. R. M. KARP, Reducibility among combinatorial problems, in Complexity of computer computations, Plenum Press, New York, 1972, pp. 85-103.
6. B. SCHWIKOWSKI, AND E. SPECKENMEYER, On Computing All Minimal Solutions for Feedback Problems, in Discrete Applied Mathematics 117(1-3), 2002, pp. 253-265.
7. V. RAMAN, S. SAURABH, AND C. R. SUBRAMANIAN, Faster fixed parameter tractable algorithms for undirected feedback vertex set, in Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002), vol. 2518 of LNCS, Springer-Verlag, Berlin, 2002, pp. 241-248.
8. I. RAZGON, Exact computation of maximum induced forest, in Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), LNCS, Berlin, 2006, Springer, to appear.