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

Faster construction of optimal binary split trees

โœ Scribed by J.H Hester; D.S Hirschberg; S.-H.S Huang; C.K Wong

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
714 KB
Volume
7
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal binary split trees
Optimal binary split trees
โœ Shou-Hsuan Stephen Huang; C.K Wong ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 455 KB
Optimal Dynamic Embeddings of Complete B
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf

Parallel construction of optimal indepen
Parallel construction of optimal independent spanning trees on hypercubes
โœ Jinn-Shyong Yang; Shyue-Ming Tang; Jou-Ming Chang; Yue-Li Wang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang,