✦ LIBER ✦

Efficient embeddings of ternary trees into hypercubes

✍ Scribed by Ajay K Gupta; Donald Nelson; Hong Wang

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 240 KB
Volume: 63
Category: Article
ISSN: 0743-7315
DOI: 10.1016/s0743-7315(03)00037-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Dynamic Embeddings of Binary T

Efficient Dynamic Embeddings of Binary Trees into Hypercubes

✍ Volker Heun; Ernst W. Mayr 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 255 KB

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small di

Embedding of tree networks into hypercub

Embedding of tree networks into hypercubes

✍ Angela Y Wu 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Embedding of binary trees into hypercube

Embedding of binary trees into hypercubes

✍ Thomas Bier; Kia-Fock Loe 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 658 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

On Embedding Binary Trees into Hypercube

On Embedding Binary Trees into Hypercubes

✍ W.K. Chen; M.F.M. Stallmann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Compact embedding of binary trees into h

Compact embedding of binary trees into hypercubes

✍ Chen Chui-Cheng; Chen Rong-Jaye 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 326 KB