scientific article

zbMath0629.68043MaRDI QIDQ3766846

Petra Scheffler

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-complete problemslinear time algorithmspartial k-treeslinear-time computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Improved self-reduction algorithms for graphs with bounded treewidth, Canonical representations of partial 2-and 3-trees, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, NC-algorithms for graphs with small treewidth, Canonical representations of partial 2- and 3-trees, Tree decomposition and discrete optimization problems: a survey, Two strikes against perfect phylogeny, Bibliography on domination in graphs and some basic definitions of domination parameters