Skip to main content
Article thumbnail
Location of Repository

Safe reduction rules for weighted treewidth

By F. van den Eijkhof, H.L. Bodlaender and A.M.C.A. Koster


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. They 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

Topics: Wiskunde en Informatica
Year: 2002
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.