An Improvement of Reed’s Treewidth Approximation

2021/01/01 by Mahdi Belbasi, Martin Fürer · 1 citation
Computer Science · #Advanced Graph Theory Research #Algorithm #Computational Geometry and Mesh Generation #Computer science #Constraint Satisfaction and Optimization #Graph #Pathwidth #Theoretical computer science #Treewidth

paper · doi:10.1007/978-3-030-68211-8_14

crossref issued 2021/01/01 · crossref published 2021/01/01 · crossref published-print 2021/01/01 · openalex publication_date 2021/01/01 · crossref published-online 2021/02/16 · crossref created 2021/02/18 · crossref deposited 2021/04/24 · crossref indexed 2025/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Citations

• Parameterized Complexity Theory
• Graph minors. III. Planar tree-width
• S-functions for graphs
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• Complexity of Finding Embeddings in a k-Tree
• A c^k n 5-Approximation Algorithm for Treewidth

Cited by

• Treewidth [wikipedia]