Algorithms finding tree-decompositions of graphs
From MaRDI portal
Publication:3197353
DOI10.1016/0196-6774(91)90020-YzbMath0712.68077OpenAlexW2115666768MaRDI QIDQ3197353
Publication date: 1991
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(91)90020-y
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (23)
Improved self-reduction algorithms for graphs with bounded treewidth ⋮ I/O-efficient algorithms for graphs of bounded treewidth ⋮ Testing superperfection of k-trees ⋮ Parametric problems on graphs of bounded tree-width ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Practical algorithms on partial k-trees with an application to domination-like problems ⋮ Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs ⋮ Graph decompositions and tree automata in reasoning with uncertainty ⋮ Online promise problems with online width metrics ⋮ Constructive linear time algorithms for branchwidth ⋮ Decomposability helps for deciding logics of knowledge and belief ⋮ A simple linear time algorithm for triangulating three-colored graphs ⋮ On the complexity of the storyplan problem ⋮ Dynamic algorithms for graphs with treewidth 2 ⋮ Minimum size tree-decompositions ⋮ Efficient sets in partial \(k\)-trees ⋮ On the complexity of finding iso- and other morphisms for partial \(k\)- trees ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ Complexity of path-forming games ⋮ Completing colored graphs to meet a target property ⋮ Reduction algorithms for graphs of small treewidth ⋮ On some optimization problems on \(k\)-trees and partial \(k\)-trees ⋮ Counting \(H-\)colorings of partial \(k-\)trees
This page was built for publication: Algorithms finding tree-decompositions of graphs
