✦ LIBER ✦

Embedding of tree networks into hypercubes

✍ Scribed by Angela Y Wu

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 697 KB
Volume: 2
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(85)90026-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding of binary trees into hypercube

Embedding of binary trees into hypercubes

✍ Thomas Bier; Kia-Fock Loe 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 658 KB

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

Multiple Network Embeddings into Hypercu

Multiple Network Embeddings into Hypercubes

✍ A.K. Gupta; S.E. Hambrusch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 823 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

Efficient embeddings of ternary trees in

Efficient embeddings of ternary trees into hypercubes

✍ Ajay K Gupta; Donald Nelson; Hong Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Incomplete Hypercubes: Embeddings of Tre

Incomplete Hypercubes: Embeddings of Tree-Related Networks

✍ S. Ohring; S.K. Das 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 911 KB

We consider the incomplete hypercubes, a generalization of the binary hypercube networks in the sense that the number of nodes can be arbitrary as opposed to a strict power of 2 . The capability of the incomplete hypercubes to execute parallel programs is studied here using graph embedding technique