scientific article; zbMATH DE number 4016952

MaRDI QIDQ3029044zbMATH OpenFDO

Authors Stefan Arnborg, Andrzej Proskurowski

Publication date 1986

zbMATH Keywords

algorithmclique-separatorsk- decomposable graphsk-cliquek-treeNP-completenessPartial k-tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Decomposition by clique separators
• scientific article; zbMATH DE number 4094838
• Optimal decomposition by clique separators
• scientific article; zbMATH DE number 637311
• Algorithms finding tree-decompositions of graphs

Cited in

(17)

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• On some optimization problems on \(k\)-trees and partial \(k\)-trees
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• ON A GENERALIZATION OF DEHN'S ALGORITHM
• scientific article; zbMATH DE number 4053039 (Why is no real title available?)
• scientific article; zbMATH DE number 4110748 (Why is no real title available?)
• scientific article; zbMATH DE number 1300393 (Why is no real title available?)
• scientific article; zbMATH DE number 637311 (Why is no real title available?)
• scientific article; zbMATH DE number 1472110 (Why is no real title available?)
• Revisiting decomposition by clique separators
• Decomposition by maxclique separators
• scientific article; zbMATH DE number 2087248 (Why is no real title available?)
• Seeing Arboretum for the (partial k-) Trees
• scientific article; zbMATH DE number 7566051 (Why is no real title available?)
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
• Algorithms for (0, 1,d)-graphs withdconstrains

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 Q3029044)