FPT algorithms for connected feedback vertex set

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

Volumn 5942 LNCS, Issue , 2010, Pages 269-280

  Misra, Neeldhara ^a   Philip, Geevarghese ^a   Raman, Venkatesh ^a   Saurabh, Saket ^a   Sikdar, Somnath ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL FEEDBACK; CONNECTIVITY PROBLEMS; FEEDBACK VERTEX SET; FIXED GRAPHS; FPT ALGORITHMS; GENERAL GRAPH; GRAPH G; GROUP STEINER TREE; PARAMETERIZED ALGORITHM; STEINER TREES; UNDIRECTED GRAPH;

ALGORITHMS; PARAMETERIZATION;

COMPUTATION THEORY;

EID: 77949589727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11440-3_25     Document Type: Conference Paper

References (22)

1. Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2009)
2. Bodlaender, H.L.: On disjoint cycles. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 230-238. Springer, Heidelberg (1992)
3. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6), 1305-1317 (1996)
4. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A.,Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563-574. Springer, Heidelberg (2008)
5. Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 422-433. Springer, Heidelberg (2007)
6. 3) FPT-Algorithm for the Undirected Feedback Vertex Set problem. In:Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859-869. Springer, Heidelberg (2005)
7. Demaine, E.D., Hajiaghayi, M.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1), 19-36 (2008)
8. Demaine, E.D., Hajiaghayi, M., ichi Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: Proceedings of FOCS 2005, pp. 637-646. IEEE Computer Society, Los Alamitos (2005)
9. Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
10. Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp. 836-845. IEEE, Los Alamitos (2007)
11. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through Colors and IDs. In: Albers, S., et al. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 378-389. Springer, Heidelberg (2009)
12. Festa, P., Pardalos, P.M., Resende, M.G.: Feedback set problems. In: Handbook of Combinatorial Optimization, pp. 209-258. Kluwer Academic Publishers, Dordrecht (1999)
13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
14. n. Algorithmica 52(2), 153-166 (2008)
15. Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proceedings of SODA 2010 (2010) (to appear)
16. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R.,Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences 72(8), 1386-1396 (2006)
17. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory of Computing Systems 43(2), 234-253 (2008)
18. Moser, H.: Exact algorithms for generalizations of vertex cover. Master's thesis, Institut für Informatik, Friedrich-Schiller-Universität (2005)
19. Nederlof, J.: Fast polynomial-space algorithms using möbius inversion: Improving on steiner tree and related problems. In: Albers, S., et al. (eds.) ICALP 2009, pp. 713-725. Springer, Heidelberg (2009)
20. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
21. Sitters, R., Grigoriev, A.: Connected feedback vertex set in planar graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911. Springer, Heidelberg (2009)
22. Thomassé, S.: A quadratic kernel for feedback vertex set. In: Proceedings of SODA 2009, pp. 115-119. Society for Industrial and Applied Mathematics (2009)