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

Quick recovery of two embedded complete binary trees in a hypercube

โœ Scribed by Hsu, C.-C.; Liu, Y.-W.

Book ID
114448102
Publisher
The Institution of Electrical Engineers
Year
1994
Tongue
English
Weight
567 KB
Volume
141
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Embedding Large Complete Binary Trees in
Embedding Large Complete Binary Trees in Hypercubes with Load Balancing
โœ Kemal Efe ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of ''normal'' algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding metho