Optimal embedding of incomplete binary trees onto incomplete hypercubes

Chien Hung Huang, Ju-Yuan Hsiao, R. C.T. Lee, Jywe Fei Fang

研究成果: Conference article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)80-85
頁數6
期刊Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
出版狀態Published - 1999 十二月 1
事件Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) - Perth/Fremantle, Aust
持續時間: 1999 六月 231999 六月 25

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

指紋 深入研究「Optimal embedding of incomplete binary trees onto incomplete hypercubes」主題。共同形成了獨特的指紋。

引用此