The algorithmic theory of treewidth

zbMATH Open1412.05183MaRDI QIDQ2816059FDOQ2816059

Authors: Hans L. Bodlaender 

Publication date: 1 July 2016

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

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

zbMATH Keywords

treewidthgraph algorithmspartial \(k\)-tree

Mathematics Subject Classification ID

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

Cited In (16)

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

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)