Computing Tree Decompositions
From MaRDI portal
Publication:5042458
DOI10.1007/978-3-030-42071-0_14OpenAlexW3020612480MaRDI QIDQ5042458
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_14
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Upper bounds on the size of obstructions and intertwines
- Cutwidth: obstructions and algorithmic aspects
- Graph minors. XIII: The disjoint paths problem
- Approximating clique-width and branch-width
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Graph expansion and the unique games conjecture
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Query evaluation via tree-decompositions
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Complexity of Finding Embeddings in a k-Tree
- Computing the Minimum Fill-In is NP-Complete
- Constructive linear time algorithms for branchwidth
- Constructive algorithm for path-width of matroids
- Definability equals recognizability for graphs of bounded treewidth
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Canonizing Graphs of Bounded Tree Width in Logspace
- Finding branch-decompositions of matroids, hypergraphs, and more
- Inapproximability of Treewidth and Related Problems
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Computing Tree Decompositions
