Tree decompositions with small cost

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 378-387

  Bodlaender, Hans L ^a   Fomin, Fedor V ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

BIPARTITE GRAPHS; MINIMAL TRIANGULATIONS; POLYNOMIAL NUMBER; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC NETWORK; RUNNING TIME; TREE DECOMPOSITION; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 84943229930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_39     Document Type: Conference Paper

References (12)

1. B. Aspvall, A. Proskurowski, and J. A. Telle. Memory requirements for table computations in partial k-tree algorithms. Algorithmica, 27:382–394, 2000.
2. H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181–188, 1993.
3. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput , 31(1), 2001.
4. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph classes: a survey. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1999.
5. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Series B, 16:47–56, 1974.
6. F. V. Jensen. Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science, Springer-Verlag, New York, 2001.
7. U. Kjærulff. Triangulation of graphs — algorithms giving small total state space. Research Report R-90-09, Dept. of Mathematics and Computer Science, Aalborg University, 1990.
8. U. Kjærulff. Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing, 2:2–17, 1992.
9. S. J. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological), 50:157–224, 1988.
10. A. Parra and P. Scheffler. How to use the minimal separators of a graph for its chordal triangulation. In Automata, languages and programming (Szeged, 1995), pages 123–134. Springer, Berlin, 1995.
11. D. Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82:273–302, 1996.
12. W. X. Wen. Optimal decomposition of belief networks. In P. P. Bonissone, M. Henrion, L. N. Kanal, and J. F. Lemmer, editors, Proceedings of the Sixth Workshop on Uncertainty in Artificial Intelligence, pages 245–256, 1990.