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

Embeddings and Other Mappings of Rooted Trees Into Complete Trees

โœ Scribed by Nicholas Georgiou

Publisher
Springer Netherlands
Year
2005
Tongue
English
Weight
450 KB
Volume
22
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Congestion-free, dilation-2 embedding of
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
โœ Tseng, Yu-Chee; Chen, Yuh-Shyan; Juang, Tong-Ying; Chang, Chiou-Jyu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 291 KB ๐Ÿ‘ 2 views

Trees are a common structure to represent the intertask communication pattern of a parallel algorithm. In this paper, we consider the embedding of a complete binary tree in a star graph with the objective of minimizing congestion and dilation. We develop two embeddings: (i) a congestion-free, dilati