An improved parameterized algorithm for treewidth

Cites Work

Fundamentals of parameterized complexity
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Graph minors. XX: Wagner's conjecture
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
Title not available (Why is that?)
Title not available (Why is that?)
Parameterized algorithms
Title not available (Why is that?)
Nonserial dynamic programming
A linear time algorithm for finding tree-decompositions of small treewidth
Approximation algorithms for treewidth
Large Induced Subgraphs via Triangulations and CMSO
An improved parameterized algorithm for the minimum node multiway cut problem
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
S-functions for graphs
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Graph minors. III. Planar tree-width
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Safe separators for treewidth
A \(c^k n\) 5-approximation algorithm for treewidth
Title not available (Why is that?)
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
Algorithms finding tree-decompositions of graphs
Kernelization. Theory of parameterized preprocessing
Inapproximability of treewidth and related problems
Improved self-reduction algorithms for graphs with bounded treewidth
An improvement of Reed's treewidth approximation
Finding all leftmost separators of size \(\le k\)
Finding optimal triangulations parameterized by edge clique cover
Title not available (Why is that?)

Cited In (1)

A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time

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)