scientific article; zbMATH DE number 4024784

MaRDI QIDQ3766846zbMATH OpenFDO

Authors Petra Scheffler

Publication date 1987

zbMATH Keywords

linear time algorithmslinear-time computabilityNP-complete problemspartial k-trees

Mathematics Subject Classification ID

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

Recommendations

• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Linear-time algorithms for partial k-tree complements
• scientific article; zbMATH DE number 4094838
• Practical algorithms on partial k-trees with an application to domination-like problems
• scientific article; zbMATH DE number 3866594

Cited in

(21)

• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Canonical representations of partial 2- and 3-trees
• Improved self-reduction algorithms for graphs with bounded treewidth
• \(k\)-NLC graphs and polynomial algorithms
• Polynomial time algorithms for variants of graph matching on partial k-trees
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• Tree decomposition and discrete optimization problems: a survey
• scientific article; zbMATH DE number 3878376 (Why is no real title available?)
• scientific article; zbMATH DE number 3917707 (Why is no real title available?)
• scientific article; zbMATH DE number 3974289 (Why is no real title available?)
• scientific article; zbMATH DE number 4101265 (Why is no real title available?)
• scientific article; zbMATH DE number 140151 (Why is no real title available?)
• scientific article; zbMATH DE number 515738 (Why is no real title available?)
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Linear-time computation of optimal subgraphs of decomposable graphs
• scientific article; zbMATH DE number 1864596 (Why is no real title available?)
• Canonical representations of partial 2-and 3-trees
• Two strikes against perfect phylogeny
• NC-algorithms for graphs with small treewidth
• A finite presentation of graphs of treewidth at most three
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766846)