A Complete Anytime Algorithm for Treewidth
暂无分享,去创建一个
[1] Eugene C. Freuder. A sufficient condition for backtrack-bounded search , 1985, JACM.
[2] Dan Geiger,et al. A Practical Algorithm for Finding Optimal Triangulations , 1997, AAAI/IAAI.
[3] Linda C. van der Gaag,et al. Pre-processing for Triangulation of Probabilistic Networks , 2001, UAI.
[4] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[5] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[6] Ton Kloks. Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.
[7] Eyal Amir,et al. Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.
[8] Arie M. C. A. Koster,et al. Treewidth: Computational Experiments , 2001, Electron. Notes Discret. Math..
[9] Brian Lucena,et al. A New Lower Bound for Tree-Width Using Maximum Cardinality Search , 2003, SIAM J. Discret. Math..
[10] Dan Geiger,et al. A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..
[11] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .