A sufficiently fast algorithm for finding close to optimal clique trees

[1]  Dan Geiger,et al.  Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem , 1996, Artif. Intell..

[2]  Rina Dechter,et al.  Structure-Driven Algorithms for Truth Maintenance , 1996, Artif. Intell..

[3]  Jens Lagergren,et al.  Efficient Parallel Algorithms for Graphs of Bounded Tree-Width , 1996, J. Algorithms.

[4]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[5]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[6]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[7]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[8]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.

[9]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height , 1991, WG.

[10]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[11]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[14]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

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

[16]  William H. Cunningham.  The Optimal Multiterminal Cut Problem , 1989, Reliability Of Computer And Communication Networks.

[17]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

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

[19]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[20]  S. Arnborg,et al.  Characterization and recognition of partial 3-trees , 1986 .

[21]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[22]  D. Rose.  Triangulated graphs and the elimination process , 1970 .