On edge-disjoint spanning trees in hypercubes
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
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.
Details
| Original language | English |
|---|---|
| Pages (from-to) | 13 - 16 |
| Journal | Information processing letters : devoted to the rapid publication of short contributions to information processing |
| Volume | 70 |
| Issue number | 1 |
| Publication status | Published - 1999 |
| Peer-reviewed | Yes |
External IDs
| Scopus | 0033574357 |
|---|