On edge-disjoint spanning trees with small depths

DOI10.1016/S0020-0190(00)00078-8zbMath1339.68206MaRDI QIDQ294801

Toru Hasunuma

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000788?np=y

zbMATH Keywords

computational complexityparallel processingNP-hardnessbroadcastingedge-disjoint spanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Broadcasting and Gossiping in de Bruijn Networks

This page was built for publication: On edge-disjoint spanning trees with small depths