Embedding torus on the star graph
Dilip Kr. Saikia, R. Badrinath, R.K. Sen · IEEE Transactions on Parallel and Distributed Systems · 1998
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 (/spl ap/2) with an increase in expansion cost. For a second routing scheme, the congestion is O(n), for an n-star, with bounded expansion.