By Topic

Embedding torus on 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)
Saikia, D.K. ; Dept. of Comput. Sci., Tezpur Univ., India ; Badrinath, R. ; Sen, R.K.

In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion is bound by a small constant (≈2) with an increase in expansion cost. For a second routing scheme, the congestion is O(n), for an n-star, with bounded expansion

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:9 ,  Issue: 7 )