Publication:4734761
From MaRDI portal
zbMath0684.68047MaRDI QIDQ4734761
Publication date: 1988
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
Related Items
A simple linear-time algorithm for finding path-decompositions of small width, Monadic second-order evaluations on tree-decomposable graphs, On minimum dominating sets with minimum intersection, Complexity of path-forming games, A partial k-arboretum of graphs with bounded treewidth, Characterizing multiterminal flow networks and computing flows in networks of small treewidth, On some optimization problems on \(k\)-trees and partial \(k\)-trees, PLA folding in special graph classes, Improved self-reduction algorithms for graphs with bounded treewidth, The nonexistence of reduction rules giving an embedding into a \(k\)-tree, Fugitive-search games on graphs and related parameters, Tree-width, path-width, and cutwidth, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, Max NP-completeness made easy