Abstract
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Zheng, Y., & Choueiry, B. Y. (2005). New structural decomposition techniques for Constraint Satisfaction Problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3419 LNAI, pp. 113–127). Springer Verlag. https://doi.org/10.1007/11402763_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
