𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Embedding K-ary Complete Trees into Hypercubes

✍ Scribed by X.J. Shen; Q. Hu; W.F. Liang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
529 KB
Volume
24
Category
Article
ISSN
0743-7315

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 the Complete Tree in the Hyper
Embedding the Complete Tree in the Hypercube
✍ A.S. Wagner πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 453 KB

Let \(H_{n}\) be the \(n\)-dimensional boolean hypercube with \(2^{n}\) vertices labeled \(\left\{0,1, \ldots 2^{n}-1\right\}\), with an edge between two vertices whenever their Hamming distance is 1. We describe a spanning tree \(T_{n}\) of \(H_{n}\) with the following properties. \(T_{n}\) is comp

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