๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Completely independent spanning trees in torus networks

โœ Scribed by Toru Hasunuma; Chie Morisaka

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
560 KB
Volume
60
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Multicast in Wormhole-Switched Torus Net
Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees
โœ Honge Wang; Douglas M. Blough ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 486 KB

A tree-based multicast algorithm for wormhole-switched networks which makes use of multiple edge-disjoint spanning trees is presented. The disjoint spanning-tree multicast, or DSTM, algorithm provides deadlock-free multicast routing that is fully compatible with unicast. The application of the DSTM

Maximizing spanning trees in almost comp
Maximizing spanning trees in almost complete graphs
โœ Gilbert, Bryan; Myrvold, Wendy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 94 KB ๐Ÿ‘ 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening out path lengths increases the number of spa

Maximizing spanning trees in almost comp
Maximizing spanning trees in almost complete graphs
โœ Gilbert, Bryan; Myrvold, Wendy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 94 KB ๐Ÿ‘ 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening-out path lengths increases the number of spa