On constructing multiple spanning trees in a hypercube

DOI10.1016/0020-0190(93)90116-QMaRDI QIDQ1209981zbMATH OpenOpenAlexFDO

Authors Feng-Hsu Wang, Ferng-Ching Lin

Publication date 16 May 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(93)90116-q

zbMATH Keywords

data structurecongestionfault tolerancehypercube networkcommunication treebinary tree algorithmsinorder spanning treesrouting paths

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• On edge-disjoint spanning trees in hypercubes
• Routing multiple paths in hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• Hierarchical spanning trees and distributing on incomplete hypercubes

Cites work

• A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
• Gray codes, fast Fourier transforms and hypercubes
• Optimum broadcasting and personalized communication in hypercubes

Cited in

(4)

• Spanning Trees and Domination in Hypercubes
• Spanning Balanced Trees in Boolean Cubes
• Taking random walks to grow trees in hypercubes
• On Hamiltonian circuits and spanning trees of hypercubes

This page was built for publication: On constructing multiple spanning trees in a hypercube

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