Safe reduction rules for weighted treewidth

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

Volumn 2573 LNCS, Issue , 2002, Pages 176-185

  Van Den Eijkhof, Frank ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS OF ALGORITHMS; PROBABILISTIC NETWORK; PROBLEM SIZE; REDUCTION RULES; TREE-WIDTH;

GRAPH THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 84901391295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_16     Document Type: Conference Paper

References (13)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
2. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth., 7:305-314, 1986.
3. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial κ-trees. Disc. Appl. Math., 23:11-24, 1989.
4. H. L. Bodlaender. A partial κ-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1-45, 1998.
5. H. L. Bodlaender, A. M. C. A. Koster, F. van den Eijkhof, and L. C. van der Gaag. Pre-processing for triangulation of probabilistic networks. In J. Breese and D. Koller, editors, Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pages 32-39, San Francisco, 2001. Morgan Kaufmann.
6. H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181-188, 1993.
7. F. V. Jensen. Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science, Springer-Verlag, New York, 2001.
8. T. Kloks. Treewidth. Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer-Verlag, Berlin, 1994.
9. A. M. C. A. Koster, S. P. M. van Hoesel, and A. W. J. Kolen. Solving frequency assignment problems via tree-decomposition. Technical Report RM/99/011, Faculty of Economics and Business Administration, Universiteit Maastricht, Maastricht, the Netherlands, 1999.
10. J. Lagergren. The nonexistence of reduction rules giving an embedding into a κ-tree. Disc. Appl. Math., 54:219-223, 1994.
11. 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.
12. J. Matoušek and R. Thomas. Algorithms for finding tree-decompositions of graphs. J. Algorithms, 12:1-22, 1991.
13. D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Math., 9(1):101-117, 1996.