Abstract
Several sets of reductions rules are known for preprocessing a graph when computing its treewidth. In this paper, we give reduction rules for a weighted variant of treewidth, motivated by the analysis of algorithms for probabilistic networks. We present two general reduction rules that are safe for weighted treewidth, which generalise many of the existing reduction rules for treewidth. Experimental results show that these reduction rules can significantly reduce the problem size for several instances of real-life probabilistic networks.
This author was partially supported by the Netherlands Computer Science Research Foundation with financial support from the Netherlands Organisation for Scientific Research.
This author was partially supported by EC contract IST-1999-14186: Project ALCOM-FT (Algorithms and Complexity - Future Technologies).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth., 7:305–314, 1986.
S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math., 23:11–24, 1989.
H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1–45, 1998.
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.
H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181–188, 1993.
F. V. Jensen. Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science, Springer-Verlag, New York, 2001.
T. Kloks. Treewidth. Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer-Verlag, Berlin, 1994.
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.
J. Lagergren. The nonexistence of reduction rules giving an embedding into a k-tree. Disc. Appl. Math., 54:219–223, 1994.
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.
J. Matouísek and R. Thomas. Algorithms for finding tree-decompositions of graphs. J. Algorithms, 12:1–22, 1991.
D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Math., 9(1):101–117, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van den Eijkhof, F., Bodlaender, H.L. (2002). Safe Reduction Rules for Weighted Treewidth. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive