An improved parameterized algorithm for treewidth
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A linear time algorithm for finding tree-decompositions of small treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithms finding tree-decompositions of graphs
- An improved parameterized algorithm for the minimum node multiway cut problem
- An improvement of Reed's treewidth approximation
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximation algorithms for treewidth
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Complexity of Finding Embeddings in a k-Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Finding all leftmost separators of size \(\le k\)
- Finding optimal triangulations parameterized by edge clique cover
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
- Fundamentals of parameterized complexity
- Graph minors. III. Planar tree-width
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1870231 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 7650942 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Improved self-reduction algorithms for graphs with bounded treewidth
- Inapproximability of treewidth and related problems
- Kernelization. Theory of parameterized preprocessing
- Large Induced Subgraphs via Triangulations and CMSO
- Nonserial dynamic programming
- Parameterized algorithms
- Parametrized complexity theory.
- S-functions for graphs
- Safe separators for treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(9)- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time
- Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
- Treewidth is NP-complete on cubic graphs
- On the parameterized complexity of Eulerian strong component arc deletion
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- Tree decompositions meet induced matchings: beyond max weight independent set
- On the parameterized complexity of Eulerian strong component arc deletion
- Tree decompositions meet induced matchings: beyond max weight independent set
- Temporal dominating set and temporal vertex cover under the lens of degree restrictions
This page was built for publication: An improved parameterized algorithm for treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499248)
