| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430741 | Journal of Computer and System Sciences | 2010 | 12 Pages |
Abstract
We 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
