It has been proved that incomplete binary trees can not be embedded onto incomplete hypercubes with both expansion-1 and dilation-1. In this paper, we propose an optimal embedding algorithm to embed this issue with expansion-1, dilation-2. Our algorithm is a linear time algorithm, which is optimal in terms of time complexity. Furthermore, the embedding scheme is as desirable to be simple such that the implementation is quite easy.
|Number of pages||6|
|Journal||Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN|
|Publication status||Published - 1999 Dec 1|
|Event||Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) - Perth/Fremantle, Aust|
Duration: 1999 Jun 23 → 1999 Jun 25
All Science Journal Classification (ASJC) codes
- Computer Science(all)