Algorithms finding tree-decompositions of graphs
From MaRDI portal
Publication:3197353
DOI10.1016/0196-6774(91)90020-YzbMath0712.68077MaRDI QIDQ3197353
Publication date: 1991
Published in: Journal of Algorithms (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Graph decompositions and tree automata in reasoning with uncertainty, Efficient sets in partial \(k\)-trees, On the complexity of finding iso- and other morphisms for partial \(k\)- trees, Complexity of path-forming games, On some optimization problems on \(k\)-trees and partial \(k\)-trees, Improved self-reduction algorithms for graphs with bounded treewidth, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs