On edge-disjoint spanning trees with small depths

DOI10.1016/S0020-0190(00)00078-8zbMATH Open1339.68206MaRDI QIDQ294801FDOQ294801

Authors 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 complexitybroadcastingNP-hardnessparallel processingedge-disjoint spanning trees

Mathematics Subject Classification ID

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

Recommendations

• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• Edge-disjoint spanning trees and forests of graphs
• On edge-disjoint spanning trees in hypercubes
• Edge‐disjoint spanning trees: A connectedness theorem
• A property on edge-disjoint spanning trees
• Edge-connectivity and edge-disjoint spanning trees
• Edge disjoint spanning trees in random graphs
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1262799 (Why is no real title available?)
• scientific article; zbMATH DE number 1263226 (Why is no real title available?)
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• Broadcasting and Gossiping in de Bruijn Networks
• Methods and problems of communication in usual networks

Cited in

(5)

• scientific article; zbMATH DE number 1444313 (Why is no real title available?)
• Independent spanning trees with small depths in iterated line digraphs
• On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights
• On edge-disjoint spanning trees in hypercubes
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees

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

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