The algorithmic theory of treewidth

MaRDI QIDQ2816059zbMATH OpenFDO

Authors Hans L. Bodlaender

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801167?np=y

zbMATH Keywords

graph algorithmspartial \(k\)-treetreewidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Treewidth: Structure and Algorithms
• scientific article; zbMATH DE number 1361465
• scientific article; zbMATH DE number 7310078
• Computational aspects of treewidth for graph
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(16)

• Special issue: Treewidth
• Structurally parameterized \(d\)-scattered set
• Parameterized orientable deletion
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• An algorithmic metatheorem for directed treewidth
• On treewidth approximations
• On exact algorithms for treewidth
• On the Threshold of Having a Linear Treewidth in Random Graphs
• scientific article; zbMATH DE number 1944139 (Why is no real title available?)
• scientific article; zbMATH DE number 4121424 (Why is no real title available?)
• On the treewidth of dynamic graphs
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• Surprising Applications of Treewidth Bounds for Planar Graphs
• A note on trees, tables, and algorithms
• Treewidth: Structure and Algorithms

This page was built for publication: The algorithmic theory of treewidth

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