Treewidth computations. II. Lower bounds

DOI10.1016/j.ic.2011.04.003zbMath1220.68071WikidataQ59567635 ScholiaQ59567635MaRDI QIDQ549673

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

Publication date: 18 July 2011

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

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

zbMATH Keywords

heuristics; treewidth; lower bounds; graph algorithms

Mathematics Subject Classification ID

05C05: Trees

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

05C85: Graph algorithms (graph-theoretic aspects)

05C51: Graph designs and isomorphic decomposition

Uses Software

• DIMACS
• Boost
• Treewidthlib
• ComputeTW
• BGL