Constraint satisfaction with bounded treewidth revisited
- Samer, Marko
- Szeider, Stefan
Publication date
March 2010
DOI Publisher
Elsevier Inc. ISSN
0022-0000 Citation count (estimate)
54Abstract
AbstractWe consider the constraint satisfaction problem (CSP) parameterized by the treewidth of primal, dual, and incidence graphs, combined with several other basic parameters such as domain size and arity. We determine all combinations of the considered parameters that admit fixed-parameter tractability
Add to ORKG