8 citations · 8 across the 2 of their papers we have counts for
2 papers
math.LO2007
CD(4) has bounded width
Catarina Carvalho, Víctor Dalmau, Petar Marković +1
We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they hav…
cs.CC2005★ 8 cited
Beyond Hypertree Width: Decomposition Methods Without Decompositions
Hubie Chen, Victor Dalmau
The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of…