By Topic

Embedding an arbitrary binary tree into the star graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bagherzadeh, N. ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; Dowd, M. ; Nassif, N.

Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network-the host network-helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with load 1 and constant dilation. The n-star graph is a recently introduced interconnection network for massively parallel systems. It enjoys symmetry and fault tolerance properties that make it a viable alternative to the hypercube. In this paper, we address the problem of embedding arbitrary binary trees into the n-star graph. This work is the first to present such an embedding. The tree has [e(n-1)1] or fewer vertices. The embedding leads to load 1 and constant dilation for all values of n. It therefore enables the star graph to efficiently simulate an arbitrary binary tree with only a constant factor of communication delay

Published in:

Computers, IEEE Transactions on  (Volume:45 ,  Issue: 4 )