By Topic

Congestion-free dilation-2 embedding of full binary trees on star graphs

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)
Saikia, D.K. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; Badrinath, R. ; Sen, R.K.

In this paper we present a scheme for congestion-free embedding of full binary trees on a star graph. The height of the tree that can be embedded with this scheme in an n-star is (n+1)[log2n]-2[log2n]+1+1. The dilation of the embedding is two. This is an improvement by a factor of two over an earlier result

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996