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. 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
van den Eijkhof, F., Bodlaender, H. & Koster, M. Safe Reduction Rules for Weighted Treewidth. Algorithmica 47, 139–158 (2007). https://doi.org/10.1007/s00453-006-1226-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-1226-x