Generalized domination in degenerate graphs: A complete dichotomy of computational complexity

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

Volumn 4978 LNCS, Issue , 2008, Pages 182-191

  Golovach, Petr ^a   Kratochvíl, Jan ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CHORDAL GRAPHS; DECISION PROBLEMS; DEGENERATE GRAPHS; DOMINATING SETS; DOMINATION IN GRAPHS; K-DEGENERATE GRAPHS; NONNEGATIVE INTEGERS; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 70349338791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_16     Document Type: Conference Paper

References (6)

1. Golovach, P., Kratochvil, J.: Computational complexity of generalized domination:A complete dichotomy for chordal graphs. In: Brandstaedt, A., Kratsch, D., Müller, H. (eds.) Graph-theoretic Concepts in Computer Science, Proceedings WG 2007. LNCS, vol. 4769, pp. 1-11. Springer, Heidelberg (2007)
2. Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 173-195 (1998)
3. Kratochví, J., Manuel, P., Miller, M.: Generalized domination in chordal graphs. Nordic Journal of Computing 2, 41-50 (1995)
4. Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing 1, 157-171 (1994)
5. Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, Ph. D tesisis, Department of Computer Science, Universiy of Oregon, Eugene (1994)
6. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529-550 (1997)