On edge-disjoint spanning trees in hypercubes

Authors
Barden, B Libeskind-Hadas, R Davis, J Williams, W
Citation
B. Barden et al., On edge-disjoint spanning trees in hypercubes, INF PROCESS, 70(1), 1999, pp. 13-16
Citations number
13
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
70
Issue
1
Year of publication
1999
Pages
13 - 16
Database
ISI
SICI code
0020-0190(19990416)70:1<13:OESTIH>2.0.ZU;2-E
Abstract
In this note we give a construction for obtaining the maximum number of edg e-disjoint spanning trees in a hypercube. The result has applications to mu lticast communication in wormhole-routed parallel computers. (C) 1999 Publi shed by Elsevier Science B.V. All rights reserved.