Treewidth computations. I: Upper bounds

DOI10.1016/j.ic.2009.03.008zbMath1186.68328WikidataQ59567681 ScholiaQ59567681MaRDI QIDQ964001

Hans L. Bodlaender, Arie M. C. A. Koster

Publication date: 14 April 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.03.008

zbMATH Keywords

upper bounds; heuristics; treewidth; graph algorithms; approximation algorithms

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68W10: Parallel algorithms in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Uses Software

• DIMACS
• Boost
• Treewidthlib
• ComputeTW
• BGL