Weighted Treewidth Algorithmic Techniques and Results
From MaRDI portal
Publication:5387824
DOI10.1007/978-3-540-77120-3_77zbMath1193.68185OpenAlexW1572255008MaRDI QIDQ5387824
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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
An extended depth-first search algorithm for optimal triangulation of Bayesian networks ⋮ Weighted Treewidth Algorithmic Techniques and Results
Cites Work
- Safe reduction rules for weighted treewidth
- A partial k-arboretum of graphs with bounded treewidth
- The Structure and Number of Obstructions to Treewidth
- Complexity of Finding Embeddings in a k-Tree
- Weighted Treewidth Algorithmic Techniques and Results
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
- Experimental and Efficient Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item