Weighted Treewidth Algorithmic Techniques and Results

DOI10.1007/978-3-540-77120-3_77MaRDI QIDQ5387824zbMATH OpenOpenAlexFDO

Authors Emgad H. Bachoore, Hans L. Bodlaender

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/22181

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for treewidth
• Treewidth computations. I: Upper bounds
• SOFSEM 2005: Theory and Practice of Computer Science
• A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
• Safe reduction rules for weighted treewidth

Cites work

• A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
• A partial k-arboretum of graphs with bounded treewidth
• Complexity of Finding Embeddings in a k-Tree
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1634667 (Why is no real title available?)
• scientific article; zbMATH DE number 1953092 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• Safe reduction rules for weighted treewidth
• The Structure and Number of Obstructions to Treewidth
• Weighted Treewidth Algorithmic Techniques and Results

Cited in

(7)

• An extended depth-first search algorithm for optimal triangulation of Bayesian networks
• Statuses and branch-weights of weighted trees
• Weighted Leaf AVL-Trees
• scientific article; zbMATH DE number 1953092 (Why is no real title available?)
• Weighted Treewidth Algorithmic Techniques and Results
• Safe reduction rules for weighted treewidth
• Weighted hypertree decompositions and optimal query plans

This page was built for publication: Weighted Treewidth Algorithmic Techniques and Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387824)