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

Embedding an arbitrary binary tree into the star graph

โœ Scribed by Bagherzadeh, N.; Dowd, M.; Nassif, N.

Book ID
119772465
Publisher
IEEE
Year
1996
Tongue
English
Weight
826 KB
Volume
45
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

A grid embedding into the star graph for
A grid embedding into the star graph for image analysis solutions
โœ Nayla Nassif; Nader Bagherzadeh ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 596 KB

In this paper, we model the star interconnection network with a graph and present an innovative grid embedding into it. The embedding is specifically designed and optimized for image analysis solutions. Using the embedding, we outline the general approach for solving such problems on the star graph