Authors
Marko Samer, Stefan Szeider
Publication date
2010/3/1
Journal
Journal of Computer and System Sciences
Volume
76
Issue
2
Pages
103-114
Publisher
Academic Press
Description
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.
Total citations
Scholar articles
M Samer, S Szeider - Journal of Computer and System Sciences, 2010
M Samer, S Szeider - Principles and Practice of Constraint Programming-CP …, 2006
M Samer, S Szeider