An improved algorithm for finding tree decompositions of small width
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- Complexity of Finding Embeddings in a k-Tree
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. VI. Disjoint paths across a disc
- Graph minors. XIII: The disjoint paths problem
- On the connectivity function of a matroid
Cited in
(36)- scientific article; zbMATH DE number 7716293 (Why is no real title available?)
- The disjoint paths problem in quadratic time
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
- A c^k n 5-approximation algorithm for treewidth
- Online promise problems with online width metrics
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- Faster parameterized algorithms for modification problems to minor-closed classes
- A more accurate view of the flat wall theorem
- Obtaining a planar graph by vertex deletion
- An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
- Finding good tree decompositions by local search
- Coloring immersion-free graphs
- A win-win algorithm for the (k+1)-LST/k-pathwidth problem
- An FPT-algorithm for recognizing k-apices of minor-closed graph classes
- Linear time algorithms for two disjoint paths problems on directed acyclic graphs
- Subexponential time algorithms for finding small tree and path decompositions
- The relative clique-width of a graph
- Algorithms finding tree-decompositions of graphs
- scientific article; zbMATH DE number 1420905 (Why is no real title available?)
- Obtaining a Planar Graph by Vertex Deletion
- An improvement of Reed's treewidth approximation
- Computing crossing numbers in quadratic time
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
- An Iterative Heuristic Algorithm for Tree Decomposition
- Improved Algorithms for the 2-Vertex Disjoint Paths Problem
- A faster parameterized algorithm for pseudoforest deletion
- Faster computation of path-width
- Parameterized algorithms for beyond-planar crossing numbers
- Walking through waypoints
- Finding small separators in linear time via treewidth reduction
- List-coloring graphs without subdivisions and without immersions
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- A simple linear-time algorithm for finding path-decompositions of small width
- MSOL restricted contractibility to planar graphs
This page was built for publication: An improved algorithm for finding tree decompositions of small width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249045)
