On edge-disjoint spanning trees in hypercubes

Research output: Contribution to journalResearch articleContributedpeer-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 languageEnglish
Pages (from-to)13 - 16
Journal Information processing letters : devoted to the rapid publication of short contributions to information processing
Volume70
Issue number1
Publication statusPublished - 1999
Peer-reviewedYes

External IDs

Scopus 0033574357

Keywords

Library keywords