Weighted treewidth algorithmic techniques and results

Authors:
Emgad Bachoore;Hans L. Bodlaender
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Year:
2007

Citing 9
Cited 0

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
The Structure and Number of Obstructions to Treewidth

SIAM Journal on Discrete Mathematics
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Bayesian Networks and Decision Graphs

Bayesian Networks and Decision Graphs
Safe Reduction Rules for Weighted Treewidth

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Safe Reduction Rules for Weighted Treewidth

Algorithmica
A branch and bound algorithm for exact, upper, and lower bounds on treewidth

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
New upper bound heuristics for treewidth

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

From the analysis of algorithms for probabilistic networks, it is known that a tree decomposition of the minimum treewidth may not be optimal for these algorithms. Instead of treewidth, we consider therefore the weighted treewidth of a weighted graph. In this paper, we present a number of heuristics for determining upper and lower bounds on the weighted treewidth, and a branch and bound algorithm for finding the exact weighted treewidth for weighted graphs.