An improvement of Reed's treewidth approximation

DOI10.1007/978-3-030-68211-8_14OpenAlexW3135387835MaRDI QIDQ2232243

Mahdi Belbasi, Martin Fuerer

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2010.03105

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

An Improvement of Reed’s Treewidth Approximation, Finding all leftmost separators of size \(\le k\)

Cites Work

• Graph minors. III. Planar tree-width
• Approximation algorithms for treewidth
• S-functions for graphs
• Graph minors. XIII: The disjoint paths problem
• Parametrized complexity theory.
• On non-serial dynamic programming
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• Complexity of Finding Embeddings in a k-Tree
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• SOFSEM 2005: Theory and Practice of Computer Science