๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embedding of binary trees into hypercubes

โœ Scribed by Thomas Bier; Kia-Fock Loe

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
658 KB
Volume
6
Category
Article
ISSN
0743-7315

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

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