Computational complexity of generalized domination: A complete dichotomy for chordal graphs

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

Volumn 4769 LNCS, Issue , 2007, Pages 1-11

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

^a UNIVERSITY OF BERGEN   (Norway)

^b CHARLES UNIVERSITY   (Czech Republic)

^c SYKTYVKAR STATE UNIVERSITY   (Russian Federation)

Author keywords

Computational complexity; Graph algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

GRAPH ALGORITHMS; POLYNOMIAL TIME; STRUCTURAL DESCRIPTION;

GRAPH THEORY;

EID: 38549152737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74839-7_1     Document Type: Conference Paper

References (15)

1. Blair, J.R.S., Peyton, B.W.: An introduction to chordal graphs and clique tree. In: George, J.A., Gilbert, J.R., Liu, J.W.H. (eds.) Sparse Matrix Computation: Graph Theory Issues and Algorithms. IMA Volumes in Mathematics and its Applications, vol. 56, pp. 1-30. Springer, Heidelberg (1993)
2. Bulatov, A.A., Jeavons, P., Krokhin, A.A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720-742 (2005)
3. Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory 42, 61-80 (2003)
4. Feder, T., Vardi, M.Y.: The computational structure of momotone monadic SNP and constraint satisfaction: A sudy through datalog and group theory. SIAM Journal of Computing 1, 57-104 (1998)
5. Fiala, J., Kratochvil, J.: Locally injective graph homomorphism: Lists guarantee dichotomy. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 15-26. Springer, Heidelberg (2006)
6. Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science 1 349, 67-81 (2005)
7. Garey, M., Johnson, D.: Computers and intractability. W.H.Freeman, New York (1979)
8. Haynes, T., Hedetniemi, S., Slater, P.: Domination in Graphs: The Theory. Marcel Dekker, New York (1997)
9. Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5, 173-195 (1998)
10. Hell, P., Nešetřil, J.: On the complexity of H-colouring. Journal of Combinatorial Theory B 48, 92-110 (1990)
11. Kratochvíl, J., Manuel, P., Miller, M.: Generalized domination in chordal graphs. Nordic Journal of Computing 2, 41-50 (1995)
12. Proskurowski, A., Telle, J.A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529-550 (1997)
13. Schaefer, T.J.: The complexity of the satisfability problem. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216-226. ACM Press, New York (1978)
14. Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing 1, 157-171 (1994)
15. Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, PhD thesis, Department of Computer Science, Universiy of Oregon, Eugene (1994)