Full constraint satisfaction problems

SIAM Journal on Computing

Volumn 36, Issue 1, 2006, Pages 230-246

  Feder, Tomás ^a   Hell, Pavol ^b  

^a Simon Fraser University ^*  (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Conservative constraint satisfaction problems; Constraint satisfaction problems; Dichotomy conjecture; Full constraint satisfaction problems; Graph homomorphisms; List homomorphisms; Matrix partitions

Indexed keywords

CONSERVATIVE CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS; DICHOTOMY CONJECTURE; FULL CONSTRAINT SATISFACTION PROBLEMS; GRAPH HOMOMORPHISMS; LIST HOMOMORPHISMS; MATRIX PARTITIONS;

COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 33847718594     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703427197     Document Type: Article

References (40)

1. J. BANG-JENSEN, P. HELL, AND G. MACGILLIVRAY, On the complexity of coloring by superdigraphs of bipartite graphs, Discrete Math., 109 (1992), pp. 27-44.
2. A. A. BULATOV, Tractable conservative constraint satisfaction problems, in Proceedings of the 18th IEEE Annual Symposium on Logic in Computer Science (LICS 2003), 2003, pp. 321-330.
3. A. A. BULATOV, A dichotomy theorem for constraints on a three-element set, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science 2002, pp. 649-658.
4. A. A. BULATOV AND P. JEAVONS, Algebraic Structures in Combinatorial Problems, Technical report MATH-AL-4-2001m, Technische Universität Dresden, Dresden, Germany, 2001.
5. A. BULATOV, P. JEAVONS, AND A. KROKHIN, Classifying the complexity of constraints using finite algebras, SIAM J. Comput., 34 (2005), pp. 720-742.
6. K. CAMERON, E. E. ESCHEN, C. T. HOÁNG, AND R. SRITHARAN, The list partition problem for graphs, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, 2004, pp. 384-392.
7. V. DALMAU AND D. FORD, Generalized satisfiability with limited occurrences per variable: A study through delta-matroid parity, in Mathematical Foundations of Computer Science (MFCS 2003), Lecture Notes in Comput. Sci. 2747, Springer, Berlin, 2003, pp. 358-367.
8. R. DECHTER, Constraint networks, in The Encyclopedia of Artificial Intelligence, Wiley, New York, 1992, pp. 276-285.
9. T. FEDER, Fanout limitations on constraint systems, Theoret. Comput. Sci., 255 (2001), pp. 281-293.
10. T. FEDER, Classification of homomorphisms to oriented cycles and of k-partite satisfiability, SIAM J. Discrete Math., 14 (2001), pp. 471-480.
11. T. FEDER AND D. FORD, Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection, SIAM J. Discrete Math., 20 (2006), pp. 372-394.
12. T. FEDER AND P. HELL, List homomorphisms to reflexive graphs, J. Combin. Theory Ser. B, 72 (1998), pp. 236-250.
13. T. FEDER, P. HELL, AND J. HUANG, List homomorphisms and circular arc graphs, Combinatorica, 19 (1999), pp. 487-505.
14. T. FEDER, P. HELL, AND J. HUANG, Bi-arc graphs and the complexity of list homomorphisms, J. Graph Theory, 42 (1999), pp. 61-80.
15. T. FEDER, P. HELL, AND J. HUANG, List homomorphisms of graphs with bounded degrees, Discrete Math., to appear.
16. T. FEDER, P. HELL, AND J. HUANG, List Homomorphisms to Reflexive Digraphs, manuscript, 2004.
17. T. FEDER, P. HELL, S. KLEIN, AND R. MOTWANI, List partitions, SIAM J. Discrete Math., 16 (2003), pp. 449-478.
18. T. FEDER, P. HELL, D. KRÁL, AND J. SGALL, Two algorithms for general list matrix partitions, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, BC, 2005, pp. 870-876.
19. T. FEDER, F. MADELAINE, AND I. A. STEWART, Dichotomies for classes of homomorphism problems involving unary functions, Theoret. Comput. Sci., 314 (2004), pp. 1-43.
20. 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), pp. 57-104.
21. A. GALLUCCIO, P. HELL, AND J. NEŠETŘ IL, The complexity of H-coloring of bounded degree graphs, Discrete Math., 222 (2000), pp. 101-109.
22. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
23. P. HELL, Prom graph colouring to constraint satisfaction - there and back again, in Topics in Discrete Mathematics, Dedicated to Jarik Nešetřil on the occasion of his 60th birthday, Algorithms Combin. 26, M. Klazar et al., eds., Springer, Berlin, 2006, pp. 407-432.
24. P. HELL, S, KLEIN, L. T. NOGUEIRA, AND F. PROTTI, Partitioning chordal graphs into independent sets and cliques, Discrete Appl. Math., 141 (2004), pp. 185-194.
25. P. HELL AND J. NEŠETŘIL, Counting list homomorphisms and graphs with bounded degrees, in Graphs, Morphisms, and Statistical Physics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 63, J. Nešetřil and P. Winkler, eds., AMS, Providence, RI, 2004, pp. 105-112.
26. P. HELL AND J. NEŠETŘIL, On the complexity of H-coloring, J. Combin. Theory Ser. B, 48 (1990), pp. 92-110.
27. P. HELL AND J. NEŠETŘIL, Graphs and Homomorphisme, Oxford University Press, Oxford, UK, 2004.
28. P. JEAVONS, On the algebraic structure of combinatorial problems, Theoret. Comput. Sci., 200 (1998), pp. 185-204.
29. P. JEAVONS, D. COHEN, AND M. GYSSENS, Closure properties of constraints, J. ACM, 44 (1997), pp. 527-548.
30. R. E. LADNER, On the structure of polynomial time reducibility, J. Assoc. Comput. Mach., 22 (1975), pp. 155-171.
31. P. LINCOLN AND J. C. MITCHELL, Algorithmic aspects of type inference with subtypes, in Proceedings of the 19th ACM Symposium on Principles of Programming Languages, 1992, pp. 293-304.
32. V. KUMAR, Algorithms for constraint-satisfaction problems, AI Magazine, 13 (1992), pp. 32-44.
33. P. MESEGUER, Constraint satisfaction problems: An overview, AICOM, 2 (1989), pp. 3-16.
34. J. C. MITCHELL, Coercion and type inference (summary), in Proceedings of the 11th ACM Symposium on Principles of Programming Languages, 1984, pp. 175-185.
35. N. MEGIDDO AND U. VISHKIN, On finding a minimum dominating set in a tournament, Theoret. Comput. Sci., 61 (1988), pp. 307-316.
36. U. MONTANARI, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci., 7 (1974), pp. 95-132.
37. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the V-C dimension, J. Comput. System Sci., 53 (1996), pp. 161-170.
38. T. J. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 216-226.
39. M. Y. VARDI, Constraint satisfaction and database theory: A tutorial, in Proceedings of the 19th Annual ACM Symposium on Principles of Database Systems (PODS 2000), 2000, pp. 76-85.
40. M. WAND AND P. M. O'KEEFE, On the complexity of type inference with coercion, in Conference on Functional Programming Languages and Computer Architecture, 1989, pp. 293-298.