✦ LIBER ✦

Multiple Network Embeddings into Hypercubes

✍ Scribed by A.K. Gupta; S.E. Hambrusch

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 823 KB
Volume: 19
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1993.1092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding of tree networks into hypercub

Embedding of tree networks into hypercubes

✍ Angela Y Wu 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 697 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

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

Embedding Hypercubes and Related Network

Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays

✍ F. Annexstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 736 KB

In this paper we study the problem of how computations programmed for hypercubes, and their bounded-degree relatives, the shuffle-exchange and cube-connected-cycles, can be efficiently emulated by mesh-connected arrays of processing elements. The emulations we present are implemented via graph embed

Embedding shuffle networks in hypercubes

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

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