An improvement of Reed's treewidth approximation

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

Authors: Mahdi Belbasi, Martin Fürer 

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)

Cites Work

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

Cited In (4)

• Finding all leftmost separators of size \(\le k\)
• Algorithms for improving the quality of \(R\)-trees
• Title not available (Why is that?)
• An improvement of Reed's treewidth approximation

This page was built for publication: An improvement of Reed's treewidth approximation

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