Algorithms finding tree-decompositions of graphs
From MaRDI portal
Recommendations
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- An improved algorithm for finding tree decompositions of small width
- scientific article; zbMATH DE number 1944139
- Approximate tree decompositions of planar graphs in linear time
- Approximate tree decompositions of planar graphs in linear time
Cited in
(44)- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Complexity of path-forming games
- Graph decomposition of slim graphs
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Improved self-reduction algorithms for graphs with bounded treewidth
- Counting \(H-\)colorings of partial \(k-\)trees
- Tree decompositions with small cost
- Reduction algorithms for graphs of small treewidth
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Completing colored graphs to meet a target property
- Space-efficient vertex separators for treewidth
- Fixed-parameter tractability of treewidth and pathwidth
- scientific article; zbMATH DE number 4016952 (Why is no real title available?)
- Tree Decompositions with Small Cost
- Approximate tree decompositions of planar graphs in linear time
- Subexponential time algorithms for finding small tree and path decompositions
- On the Threshold of Having a Linear Treewidth in Random Graphs
- scientific article; zbMATH DE number 4053039 (Why is no real title available?)
- Graph decompositions and tree automata in reasoning with uncertainty
- Constructive linear time algorithms for branchwidth
- scientific article; zbMATH DE number 1420906 (Why is no real title available?)
- Randomized Contractions Meet Lean Decompositions
- Computing Tree Decompositions
- Testing superperfection of k-trees
- Parametric problems on graphs of bounded tree-width
- Practical algorithms on partial k-trees with an application to domination-like problems
- Decomposability helps for deciding logics of knowledge and belief
- A simple linear time algorithm for triangulating three-colored graphs
- Algorithms on Trees and Graphs
- An improved algorithm for finding tree decompositions of small width
- From edge decomposition formulae to composition algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- Approximate tree decompositions of planar graphs in linear time
- Minimum size tree-decompositions
- Finding Branch-Decompositions and Rank-Decompositions
- Minimum size tree-decompositions
- On the complexity of the storyplan problem
- Dynamic algorithms for graphs with treewidth 2
- An improved parameterized algorithm for treewidth
- Efficient sets in partial k-trees
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- I/O-efficient algorithms for graphs of bounded treewidth
- Online promise problems with online width metrics
This page was built for publication: Algorithms finding tree-decompositions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197353)
