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