✦ LIBER ✦

Embedding arbitrary binary trees in a hypercube

✍ Scribed by Alan Wagner

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 1013 KB
Volume: 7
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(89)90033-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding All Binary Trees in the Hyperc

Embedding All Binary Trees in the Hypercube

✍ A.S. Wagner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 923 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

Embedding of binary trees into hypercube

Embedding of binary trees into hypercubes

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

A New Efficient Algorithm for Embedding

A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

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

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

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

Dense edge-disjoint embedding of complet

Dense edge-disjoint embedding of complete binary trees in the hypercube

✍ Somasundaram Ravindran; Alan Gibbons 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 407 KB