Algorithmic aspects of tree width
The paper gives a survey on recent results on graph algorithms that use the notions of treewidth and tree decomposition. Examples of problems where dynamic programming and divide and conquer strategies are used to solve graph problems are given, and the notions of treewidth and tree decomposition are introduced, and equivalence with other definitions is shown. The paper discusses how to find tree decompositions of bounded width, and how to use them, with applications. Also, a forbidden subgraph characterization of graphs of bounded treewidth is shown. For the entire collection see [Zbl 1005.00014].
- Treewidth: Algorithmic techniques and results
- The algorithmic theory of treewidth
- Treewidth: Structure and Algorithms
- Algorithmic applications of tree-cut width
- Algorithmic applications of tree-cut width
- Approximation algorithms for treewidth
- Tree-width in algebraic complexity
- On Exact Algorithms for Treewidth
- Computing tree width: from theory to practice and back
- On treewidth approximations
- On tree-partition-width
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Perfect edge domination and efficient edge domination in graphs
- Notes on graph product structure theory
- An improved planar graph product structure theorem
- Graph drawings with few slopes
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Boxicity and treewidth
- Introducing directed tree width
- On a characterization of \(k\)-trees.
- Algorithms finding tree-decompositions of graphs
- Treewidth: Characterizations, Applications, and Computations
- On the Threshold of Having a Linear Treewidth in Random Graphs
- Tree-Width for First Order Formulae
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1031380 (Why is no real title available?)
- On the structure of (pan, even hole)-free graphs
- Treewidth: Algorithmic techniques and results
- scientific article; zbMATH DE number 4121438 (Why is no real title available?)
- scientific article; zbMATH DE number 772777 (Why is no real title available?)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- Threshold Treewidth and Hypertree Width
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- On the queue-number of graphs with bounded tree-width
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- Structure of graphs with locally restricted crossings
- Treewidth: Structure and Algorithms
- SOFSEM 2005: Theory and Practice of Computer Science
- The Size Ramsey Number of Graphs with Bounded Treewidth
- Separating layered treewidth and row treewidth
- PTAS for Sparse General-valued CSPs
- Graphs of linear growth have bounded treewidth
- Induced subgraphs and path decompositions
- Graph product structure for non-minor-closed classes
- Treewidth, Circle Graphs, and Circular Drawings
- Product structure extension of the Alon-Seymour-Thomas theorem
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Product structure of graph classes with bounded treewidth
- Tree-partitions with bounded degree trees
- Product structure of graph classes with bounded treewidth
- Product structure of graphs with an excluded minor
- Clustered colouring of graph products
- Lower bounds for treewidth of product graphs
- On the feedback vertex set polytope of a series-parallel graph
- Improved algorithms and complexity results for power domination in graphs
- Treewidth computations. I: Upper bounds
- The bivariate Ising polynomial of a graph
This page was built for publication: Algorithmic aspects of tree width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407447)
