论文信息 - Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs.

Philippe Jégou | Samba Ndiaye | Cyril Terrioux

[1] Philippe Jégou,et al. Computing and exploiting tree-decompositions for ( Max-) CSP , 2005 .

[2] Philippe Jégou,et al. Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[3] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .

[4] Anne Berry,et al. A wide-range efficient algorithm for minimal triangulation , 1999, SODA '99.

[5] Georg Gottlob,et al. Combining hypertree, bicomp, and hinge decomposition , 2002, ECAI.

[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[7] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[8] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[9] Eyal Amir,et al. Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[10] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[11] Arie M. C. A. Koster,et al. Treewidth: Computational Experiments , 2001, Electron. Notes Discret. Math..

[12] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .