On Edge-Disjoint Spanning Trees in Hypercubes

Authors

Benjamin Barden '99, Pomona College
Ran Libeskind-Hadas, Harvey Mudd CollegeFollow
Janet Davis '99, Harvey Mudd College
William Williams '99, Harvey Mudd College

Student Co-author

Pomona Undergraduate, HMC Undergraduate

Document Type

Article

Department

Computer Science (HMC), Computer Science (Pomona)

Publication Date

1999

Abstract

In this note we give a construction for obtaining the maximum number of edge-disjoint spanning trees in a hypercube. The result has applications to multicast communication in wormhole-routed parallel computers.

Rights Information

© 1999 Elsevier Science

DOI

10.1016/S0020-0190(99)00033-2

Recommended Citation

Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams, On edge-disjoint spanning trees in hypercubes, Information Processing Letters, Volume 70, Issue 1, 16 April 1999, Pages 13-16, ISSN 0020-0190, http://dx.doi.org/10.1016/S0020-0190(99)00033-2. (http://www.sciencedirect.com/science/article/pii/S0020019099000332)