Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Discrete Applied Mathematics

Volumn 152, Issue 1-3, 2005, Pages 229-245

  Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

FPT algorithms; Graph minors; Parameterized complexity

Indexed keywords

ALGORITHMS; EDGE DETECTION; GRAPH THEORY; PATTERN RECOGNITION;

FPT ALGORITHMS; GRAPH MINORS; GRAPH SIZE; PARAMETERIZED COMPLEXITY; TRACTABLE ALGORITHMS;

PARAMETER ESTIMATION;

EID: 26444517091     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.02.029     Document Type: Article

References (33)

1. S. Arnborg Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey BIT 25 1985 2 23
2. R. Balasubramanian, M. Fellows, and V. Raman An improved fixed-parameter algorithm for vertex cover Inform. Process. Lett. 65 1998 163 168
3. D. Bienstock, N. Robertson, P.D. Seymour, and R. Thomas Quickly excluding a forest J. Combin. Theory Ser. B 52 1991 274 283
4. J.F. Buss, and J. Goldsmith Nondeterminism within P SIAM J. Comput. 22 1993 560 572
5. L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Inform. Process. Lett. 58 1996 171 176
6. L. Cai, J. Chen, R. Downey, and M. Fellows Advice classes of parameterized tractability Ann. Pure Appl. Logic 84 1997 119 138
7. K. Cattell, M.J. Dinneen, R.G. Downey, M.R. Fellows, and M.A. Langston On computing graph minor obstruction sets Theoret. Comput. Sci. A 233 2000 107 127
8. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, in: Proceedings of the 25th International Workshop on Graph-Theoretical Concepts in Computer Science, Springer, Berlin, 1999, pp. 313-324.
9. M.J. Dinneen Too many minor order obstructions (for parametrized lower ideals) J. Universal Comput. Sci. 3 11 1997 1199 1206
10. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness I: basic results SIAM J. Comput. 24 1995 873 921
11. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
12. R.G. Downey, M.R. Fellows, and U. Stege Computational tractability: the view from Mars Bull. European Assoc. Theoret. Comput. Sci. 69 1999 73 97
13. M. Farach, T. Przytycka, and M. Thorup On the agreement of many trees Inform. Process. Lett. 55 1995 297 301
14. M.R. Fellows, and M.A. Langston Nonconstructive tools for proving polynomial-time decidability J. ACM 35 1988 727 739
15. M.R. Fellows, and M.A. Langston On search, decision, and the efficiency of polynomial-time algorithms J. Comput. System Sci. 49 3 1994 769 779
16. H. Friedman, N. Robertson, and P.D. Seymour The metamathematics of the graph minor theorem Contemp. Math. 65 1987 229 261
17. H. Kaplan, R. Shamir, and R.E. Tarjan Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs SIAM J. Comput. 28 5 1999 1906 1922
18. J. Lagergren, An upper bound on the size of an obstruction, in: N. Robertson, P. Seymour (Eds.), Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Seattle WA, June 1991, American Mathematical Society of Contemporary Mathematics, vol. 147. Providence, RI, 1993 pp. 601-621.
19. J. Lagergren Upper bounds on the size of obstructions and intertwines J. Combin. Theory Ser. B 73 1998 7 40
20. M.A. Langston, and B.C. Plaut On algorithmic applications of the immersion order. An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory Discrete Math. 182 1-3 1998 191 196
21. J.M. Lewis, and C.H. Papadimitriou The node-deletion problem for hereditary properties is NP-complete J. Comput. System Sci. 20 1980 219 230
22. L. Lovasz Combinatorial Problems and Exercises 1979 North-Holland Amsterdam
23. M. Mahajan, and V. Raman Parameterizing above guaranteed values: maxsat and maxcut J. Algorithms 31 2 1999 335 354
24. K. Mehlhorn Graph algorithms and NP-completeness, Data Structures and Algorithms vol. 2 1984 Springer Berlin
25. R. Niedermeier, Some prospects for efficient fixed parameter algorithms, in: Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'98), Lecture Notes in Computer Science, vol. 1521, 1998, pp. 168-185.
26. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: C. Meinel, S. Tison, (Eds.), Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), Lecture Notes in Computer Science, vol. 1563, 1999, pp. 561-570.
27. S. Ramachandramurthi, A lower bound for treewidth and its consequences. in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of the 20th International Workshop on Graph Theoretic Concepts in Computer Science WG'94, Lecture Notes in Computer Science, vol. 903, Springer, Berlin, 1995, pp. 14-25.
28. N. Robertson, and P.D. Seymour Disjoint paths - a survey SIAM J. Algebraic Discrete Methods 6 1985 300 305
29. N. Robertson, P.D. Seymour, Graph minors - a survey, in: I. Anderson (Ed.), Surveys in Combinatorics, Cambridge University Press, Cambridge, 1985, pp. 153-171.
30. N. Robertson, and P.D. Seymour Graph minors. XIII. The disjoint paths problem J. Combin. Theory Ser. B 63 1995 65 110
31. A. Takahashi, S. Ueno, and Y. Kajitani Minimal acyclic forbidden minors for the family of graphs with bounded path-width Discrete Math. 127 1/3 1994 293 304
32. D.M. Thilikos Algorithms and obstructions for linear-width and related search parameters Discrete Appl. Math. 105 2000 239 271
33. J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, North-Holland, Amsterdam, 1990, pp. 527-631.