Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
Independent spanning trees on even networks
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Optimal Independent Spanning Trees on Odd Graphs
The Journal of Supercomputing
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The problem of broadcasting long messages on store-and-forward communication networks, where a processor (node) can send and receive messages simultaneously to and from all its neighbors, was studied by Bermond and Fraigniaud. In such networks, the delays encountered by a message from a node $v$ to all other nodes over a broadcast spanning tree is directly proportional to the length of the paths in the tree over which the message is sent. Furthermore, the speed of the broadcast can be improved by the segmentation of the message at $v$ into equal-length segments and then the broadcast of these segments over arc-disjoint broadcast spanning trees simultaneously. These observations lead Bermond and Fraigniaud to look for the maximum number of arc-disjoint spanning trees in a deBruijn network rooted at an arbitrary node with small depths. This paper improves and extends the results of the above authors.