scientific article; zbMATH DE number 637311

MaRDI QIDQ4304362zbMATH OpenFDO

Authors Arobinda Gupta, Richard B. Borie

Publication date 10 October 1994

zbMATH Keywords

decompositionsparallel algorithmsparse treepartial \(k\)-treeterminal graphsterminalstreewidth

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4016952
• scientific article; zbMATH DE number 4094838
• scientific article; zbMATH DE number 4008410
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
• Sequential and parallel algorithms for embedding problems on classes of partial k-trees

Cited in

(5)

• Balanced trees with removals: An exercise in rewriting and proof
• A partial k-arboretum of graphs with bounded treewidth
• Balanced partitions of trees and applications
• scientific article; zbMATH DE number 4016952 (Why is no real title available?)
• scientific article; zbMATH DE number 2044508 (Why is no real title available?)

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