H-Coloring dichotomy revisited

Theoretical Computer Science

Volumn 349, Issue 1, 2005, Pages 31-39

  Bulatov, Andrei A ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Algebraic approach; Complexity; Constraint satisfaction; Graph colouring

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; PROBLEM SOLVING; THEOREM PROVING;

ALGEBRAIC APPROACH; CONSTRAINT SATISFACTION; GRAPH COLORING;

COMPUTATIONAL COMPLEXITY;

EID: 27844585472     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.028     Document Type: Conference Paper

References (23)

1. A.A. Bulatov, A dichotomy theorem for constraints on a three-element set, in: Proc. 43rd IEEE Symp. on Foundations of Computer Science, FOCS'02, Vancouver, Canada, November 2002, IEEE Computer Society, Silverspring, MD, pp. 649-658.
2. A.A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proc. 18th Ann. IEEE Simp. on Logic in Computer Science, Ottawa, Canada, June 2003, IEEE Computer Society, Silverspring, MD, pp. 321-330.
3. A. Bulatov, V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, in: Proc. 44th IEEE Symp. on Foundations of Computer Science, FOCS'03, Cambridge, MA, USA, October 2003, IEEE Computer Society, Silverspring, MD, pp. 562-571.
4. A.A. Bulatov, P.G. Jeavons, A.A. Krokhin, Classifying complexity of constraints using finite algebras, SIAM Comput. 34 (2004) 720-742.
5. A.A. Bulatov, P.G. Jeavons, A.A. Krokhin, Constraint satisfaction problems and finite algebras, in: Proc. 27th Internat. Colloq. on Automata, Languages and Programming - ICALP'00, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 272-282.
6. N. Creignou, S. Khanna, M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, Vol. 7, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 2001.
7. V. Dalmau, Constraint satisfaction problems in non-deterministic logarithmic space, in: Proc. 29th Internat. Colloq. on Automata, Languages and Programming, ICALP'02, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 414-425.
8. V. Dalmau, J. Pearson, Set functions and width 1 problems, in: Proc. 5th Internat. Conf. on Constraint Programming, CP'99, Lecture Notes in Computer Science, Vol. 1713, Springer, Berlin, 1999, pp. 159-173.
9. T. Feder, and M.Y. Vardi The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory SIAM J. Comput. 28 1998 57 104
10. P. Hell, Algorithmic aspects of graph homomorphisms, in: Survey in Combinatorics 2003, London Mathematical Society Lecture Note Series, Vol. 307, Cambridge University Press, Cambridge, 2003, pp. 239-276.
11. P. Hell, and J. Nešetřil On the complexity of H-coloring J. Combin. Theory Ser. B 48 1990 92 110
12. P. Hell, Nešetřil, Graphs and homomorphisms, Oxford Lecture Series in Mathematics and its Applications, Vol. 28, Oxford University Press, Oxford, 2004.
13. P.G. Jeavons On the algebraic structure of combinatorial problems Theoret. Comput. Sci. 200 1998 185 204
14. P.G. Jeavons, D.A. Cohen, and M.C. Cooper Constraints, consistency and closure Artificial Intelligence 101 1-2 1998 251 265
15. P.G. Jeavons, D.A. Cohen, and M. Gyssens Closure properties of constraints J. ACM 44 1997 527 548
16. Ph.G. Kolaitis, Constraint satisfaction, databases, and logic, in: Proc. 17th Internat. Joint Conf. on Artificial Intelligence, IJCAI'03, 2003.
17. R. Ladner On the structure of polynomial time reducibility J. ACM 22 1975 155 171
18. B. Larose, and C. Tardif Strongly rigid graphs and projectivity Multiple-Valued Logic 7 2001 339 361
19. T. Luczak, J. Nešetřil, A note on projective graphs. Technical Report ITI Series Technical Report 2003-130, Charles University Prague, 2003.
20. J. Nešetřil, and X. Zhu On sparse graphs with given colorings and homomorphisms J. Combin. Theory B 90 2004 161 172
21. N. Pippenger Theories of Computability 1997 Cambridge University Press Cambridge
22. R. Pöschel, and L.A. Kalužnin Funktionen- und Relationenalgebren 1979 DVW Berlin
23. T.J. Schaefer The complexity of satisfiability problems Proc. 10th ACM Symp. on Theory of Computing (STOC'78) 1978 216 226