Majority constraints have bounded pathwidth duality

European Journal of Combinatorics

Volumn 29, Issue 4, 2008, Pages 821-837

  Dalmau, Víctor ^a   Krokhin, Andrei ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41549164368     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.11.020     Document Type: Article

References (23)

1. Atserias A. On digraph coloring problems and treewidth duality. LICS'05 (2005) 106-115
2. Bulatov A. Tractable conservative constraint satisfaction problems. LICS'03 (2003) 321-330
3. Bulatov A. A graph of a relational structure and constraint satisfaction problems. LICS'04 (2004) 448-457
4. Bulatov A., Jeavons P., and Krokhin A. Classifying complexity of constraints using finite algebras. SIAM Journal on Computing 34 3 (2005) 720-742
5. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001)
6. Dalmau V. Constraint satisfaction problems in non-deterministic logarithmic space. ICALP'02. LNCS vol. 2380 (2002) 414-425
7. Dalmau V. Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer Science 1 (2005) (electronic)
8. Dalmau V., Krokhin A., and Larose B. First-order definable retraction problems for reflexive graphs and posets. Journal of Logic and Computation 17 1 (2007) 31-51
9. Feder T., Hell P., and Huang J. Bi-arc graphs and the complexity of list homomorphisms. Journal of Graph Theory 42 (2003) 61-80
10. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28 (1998) 57-104
11. Grohe M. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54 1 (2007) (electronic)
12. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press
13. Hell P., Nešetřil J., and Zhu X. Duality and polynomial testing of tree homomorphisms. Transactions of the American Mathematical Society 348 (1996) 147-156
14. Jeavons P. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
15. Jeavons P.G., Cohen D.A., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
16. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
17. Kiss E., and Valeriote M. On tractability and congruence distributivity. Logical Methods in Computer Science 3 2 (2007) (electronic)
18. Kolaitis Ph.G., and Vardi M.Y. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61 (2000) 302-332
19. Krokhin A., Bulatov A., and Jeavons P. The complexity of constraint satisfaction: an algebraic approach. Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Seiries II: Math., Phys., Chem. vol. 207 (2005), Springer Verlag 181-213
20. Krokhin A., and Larose B. Solving order constraints in logarithmic space. STACS'03. LNCS vol. 2607 (2003) 379-390
21. Larose B., Loten C., and Tardif C. A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science 3 4 (2007) (electronic)
22. Larose B., and Zádori L. Bounded width problems and algebras. Algebra Universalis 56 3-4 (2007) 439-466
23. Nešetřil J., and Tardif C. Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combininatorial Theory, Ser. B 80 (2000) 80-97