Title

On Edge-Disjoint Spanning Trees in Hypercubes

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