A backtracking-based algorithm for hypertree decomposition
暂无分享,去创建一个
[1] Roman Barták,et al. Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.
[2] Georg Gottlob,et al. A CSP Hypergraph Library , 2006 .
[3] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[4] Hans L. Bodlaender,et al. Discovering Treewidth , 2005, SOFSEM.
[5] Arie M. C. A. Koster,et al. Treewidth: Computational Experiments , 2001, Electron. Notes Discret. Math..
[6] Francesco Scarcello,et al. Cost-based Query Decompositions , 2002, Sistemi Evoluti per Basi di Dati.
[7] Georg Gottlob,et al. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2001, PODS '01.
[8] Thomas Schwentick,et al. Generalized hypertree decompositions: np-hardness and tractable variants , 2007, PODS '07.
[9] Aditya K. Ghose,et al. Reducing redundancy in the hypertree decomposition scheme , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.
[10] Georg Gottlob,et al. On Tractable Queries and Constraints , 1999, DEXA.
[11] Francesco Scarcello,et al. Weighted hypertree decompositions and optimal query plans , 2007, J. Comput. Syst. Sci..
[12] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[13] Rina Dechter,et al. chapter 4 – Directional Consistency , 2003 .