Parameterized complexity of generalized domination problems

Discrete Applied Mathematics

Volumn 160, Issue 6, 2012, Pages 780-792

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

^a DURHAM UNIVERSITY   (United Kingdom)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Even set; Generalized domination; Odd set; Parameterized complexity

Indexed keywords

COMPLETE PROBLEMS; DOMINATING SETS; DOMINATION PROBLEM; DUAL PARAMETERIZATION; EVEN SET; FINITE SET; GENERALIZED DOMINATION; GRAPH G; NONNEGATIVE INTEGERS; ODD INTEGERS; ODD SET; PARAMETERIZED; PARAMETERIZED COMPLEXITY;

COMBINATORIAL MATHEMATICS; MATHEMATICAL TECHNIQUES;

GRAPH THEORY;

EID: 84858159154     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.11.012     Document Type: Conference Paper

References (37)

1. I. Adler, B.-M. Bui-Xuan, Y. Rabinovich, G. Renault, J.A. Telle, and M. Vatshelle On the Boolean-width of a graph: structure and applications D. Thilikos, WG 2010 LNCS vol. 6410 2010 Springer
2. N. Alon, and S. Gutner Linear time algorithms for finding a dominating set of fixed size in degenerated graphs G. Lin, COCOON 2007 LNCS vol. 4598 2007 Springer 394 405
3. H.L. Bodlaender, D. Kratsch, A note on fixed parameter intractability of some domination-related problems, Private Communication, 1994, Reported in M. Cesati, Compendium of Parameterized Problems, 2001. Available online at: http://bravo.ce.uniroma2.it/home/cesati/research/compendium.pdf.
4. H.L. Bodlaender, E.J. van Leeuwen, J.M.M. van Rooij, and M. Vatshelle Faster algorithms on branch and clique decompositions P. Hliněný, A. Kuera, MFCS 2010 LNCS vol. 6281 2007 Springer 174 185
5. H.L. Bodlaender, J.M.M. van Rooij, and P. Rossmanith Dynamic programming on tree decompositions using generalised fast subset convolution A. Fiat, P. Sanders, ESA 2009 LNCS vol. 5757 2009 Springer 566 577
6. M. Cesati Perfect code is W[1] -complete Inform. Process. Lett. 81 2002 163 168
7. M. Chapelle, Parameterized complexity of generalized domination problems on bounded tree-width graphs, CoRRabs/1004.2642, 2010. http://arxiv.org/abs/ 1004.2642.
8. B. Courcelle, J.A. Makowsky, and U. Rotics Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Syst. 33 2 2000 125 150
9. A. Dawar, S. Kreutzer, Parameterized complexity of first-order logic, Electronic Colloquium on Computational Complexity, TR09-131, 2009.
10. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness Congr. Numer. 1992 161 178
11. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness. II. On completeness for W[1] Theoret. Comput. Sci. 141 1995 109 131
12. R.G. Downey, and M.R. Fellows Parameterized Complexity 1998 Springer
13. R.G. Downey, and M.R. Fellows Threshold dominating sets and an improved characterization of W[2] Theoret. Comput. Sci. 209 1998 123 140 (Pubitemid 128450433)
14. R.G. Downey, M.R. Fellows, A. Vardy, and G. Whittle The parametrized complexity of some fundamental problems in coding theory SIAM J. Comput. 29 1999 545 570 (electronic)
15. Z. Dvok, D. Krl, R. Thomas, Deciding first-order properties for sparse graphs, Proceedings 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10), pp. 133142, 2010, preliminary version available as vol. 2009-484 of ITI-series at: http://iti.mff.cuni.cz/series/files/2009/iti484.pdf.
16. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
17. F.V. Fomin, P.A. Golovach, J. Kratochvíl, D. Kratsch, and M. Liedloff Sort and search: exact algorithms for generalized domination Inform. Process. Lett. 109 14 2009 795 798
18. F.V. Fomin, P.A. Golovach, J. Kratochvíl, D. Kratsch, and M. Liedloff Branch and recharge: exact algorithms for generalized domination Algorithmica 2010 10.1007/s00453-010-9418-9
19. P.A. Golovach, and J. Kratochvíl Computational complexity of generalized domination: a complete dichotomy for chordal graphs A. Brandstdt, D. Kratsch, H. Mller, WG 2007 LNCS vol. 4769 2007 Springer 1 11 (Pubitemid 351152817)
20. P.A. Golovach, and J. Kratochvíl Generalized domination in degenerate graphs: a complete dichotomy of computational complexity M. Agrawal, D.-Z. Du, Z. Duan, A. Li, TAMC 2008 LNCS vol. 4978 2008 Springer 182 191
21. P.A. Golovach, J. Kratochvíl, and O. Such Parameterized complexity of generalized domination problems WG 2009 LNCS vol. 5911 2009 Springer 133 142
22. M.M. Halldrsson, J. Kratochvíl, and J.A. Telle Mod-2 independence and domination in graphs Internat. J. Found. Comput. Sci. 11 2000 355 363
23. P. Heggernes, and J.A. Telle Partitioning graphs into generalized dominating sets Nordic J. Comput. 5 1998 128 142
24. T. Kloks, L. Cai, 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.
25. J. Kratochvíl Perfect codes in general graphs Rozpravy eskoslovensk Akad. Vd MPV 7, Academia 1991
26. J. Kratochvíl, P.D. Manuel, and M. Miller Generalized domination in chordal graphs Nordic J. Comput. 2 1995 41 50
27. H. Moser, and D.M. Thilikos Parameterized complexity of finding regular induced subgraphs H. Broersma, S.S. Dantchev, M. Johnson, S. Szeider, ACiD 2006 Texts in Algorithmics vol. 7 2006 King's College London 107 118
28. J. Neetil, and P. Ossona de Mendez The grad of a graph and classes with bounded expansion Electron. Notes Discrete Math. 22 2005 101 106
29. J. Neetil, and P. Ossona de Mendez First order properties on nowhere dense structures J. Symbolic Logic 75 3 2010 868 887
30. J. Neetil, and P. Ossona de Mendez Grad and classes with bounded expansion I. Decompositions European J. Combin. 29 3 2008 760 776
31. J. Neetil, and P. Ossona de Mendez Grad and classes with bounded expansion II. Algorithmic aspects European J. Combin. 29 3 2008 777 791
32. J. Neetil, and P. Ossona de Mendez Grad and classes with bounded expansion III. Restricted graph homomorphism dualities European J. Combin. 29 4 2008 1012 1024
33. J. Neetil, P. Ossona de Mendez, On nowhere dense graphs, European J. Combin. (submitted for publication).
34. R. Niedermeier Invitation to Fixed Parameter Algorithms 2006 Oxford University Press USA
35. J.A. Telle Complexity of domination-type problems in graphs Nordic J. Comput. 1 1994 157 171
36. J.A. Telle, Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, Ph.D. Thesis, Department of Computer Science, University of Oregon, Eugene, 1994.
37. J.A. Telle, and A. Proskurowski Algorithms for vertex partitioning problems on partial k-trees SIAM J. Discrete Math. 10 1997 529 550 (Pubitemid 127642991)