Sciweavers

ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson