Parameterized complexity of generalized domination problems

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

Volumn 5911 LNCS, Issue , 2010, Pages 133-142

  Golovach, Petr A ^a   Kratochvíl, Jan ^b   Suchý, Ondřej ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE PROBLEMS; DOMINATING SETS; DOMINATION PROBLEM; FINITE SET; GRAPH G; NONNEGATIVE INTEGERS; ODD INTEGERS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARAMETRIZATIONS;

COMPUTER SCIENCE; SET THEORY;

GRAPH THEORY;

EID: 72549088940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11409-0_12     Document Type: Conference Paper

References (20)

1. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 394-405. Springer, Heidelberg (2007)
2. Bodlaender, H.L., Kratsch, D.: A note on fixed parameter intractability of some domination-related problems. Private communication (1994)
3. Cesati, M.: Perfect code is W[1]-complete. Inf. Process. Lett. 81, 163-168 (2002)
4. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007, pp. 270-279. IEEE Computer Society Press, Los Alamitos (2007)
5. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium, 161-178 (1992)
6. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoret. Comput. Sci. 141, 109-131 (1995)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)
8. Downey, R.G., Fellows, M.R.: Threshold dominating sets and an improved characterization of W[2]. Theoret. Comput. Sci. 209, 123-140 (1998)
9. Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput. 29 (electronic), 545-570 (1999)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Golovach, P.A., Kratochvíl, J.: Computational complexity of generalized domination: A complete dichotomy for chordal graphs. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 1-11. Springer, Heidelberg (2007)
12. Golovach, P.A., Kratochvíl, J.: Generalized domination in degenerate graphs: a complete dichotomy of computational complexity. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 182-191. Springer, Heidelberg (2008)
13. Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 128-142 (1998)
14. Kloks, T., Cai, L.: Parameterized tractability of some (efficient) Y - domination variants for planar graphs and t-degenerate graphs. In: Proceedings of the International Computer Symposium (ICS 2000), Taiwan (2000)
15. Kratochvíl, J., Manuel, P.D., Miller, M.: Generalized domination in chordal graphs. Nordic J. Comput. 2, 41-50 (1995)
16. Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. In: Broersma, H., Dantchev, S.S., Johnson, M., Szeider, S. (eds.) ACiD 2006. Texts in Algorithmics, vol. 7, pp. 107-118. King's College, London (2006)
17. Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford University Press, USA (2006)
18. Telle, J.A.: Complexity of domination-type problems in graphs. Nordic J. Comput. 1, 157-171 (1994)
19. Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees. PhD thesis. Department of Computer Science, University of Oregon, Eugene (1994)
20. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529-550 (1997)