✦ LIBER ✦

Embeddings in hypercubes

✍ Scribed by Marilynn Livingston; Quentin F. Stout

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 618 KB
Volume: 11
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(88)90486-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiple Network Embeddings into Hypercu

Multiple Network Embeddings into Hypercubes

✍ A.K. Gupta; S.E. Hambrusch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 823 KB

Distributed fault-tolerant embeddings of

Distributed fault-tolerant embeddings of rings in hypercubes

✍ Mee Yee Chan; Shiang-Jen Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 881 KB

Embedding shuffle networks in hypercubes

✍ Ravi Varadarajan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 485 KB

On Scale Embeddings of Graphs into Hyper

On Scale Embeddings of Graphs into Hypercubes

✍ S.V. Shpectorov 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 492 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

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