An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Chien-Hung Huang Articles by Ju-Yuan Hsiao Articles by R.C.T. Lee Articles by Jywe-Fei Fang

1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99)

Fremantle, Australia

June 23-June 25

ISBN: 0-7695-0231-8

	ASCII Text	x
	Chien-Hung Huang, Ju-Yuan Hsiao, R.C.T. Lee, Jywe-Fei Fang, "An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 80, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999.

	BibTex	x
	@article{ 10.1109/ISPAN.1999.778921, author = {Chien-Hung Huang and Ju-Yuan Hsiao and R.C.T. Lee and Jywe-Fei Fang}, title = {An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1999}, issn = {1087-4089}, pages = {80}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778921}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes SN - 1087-4089 SP EP A1 - Chien-Hung Huang, A1 - Ju-Yuan Hsiao, A1 - R.C.T. Lee, A1 - Jywe-Fei Fang, PY - 1999 VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Chien-Hung Huang, National Tsing Hua University

Ju-Yuan Hsiao, National Changhua University of Education

R.C.T. Lee, Providence University

Jywe-Fei Fang, Tung Nan Junior College of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.1999.778921

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.

Citation:

Chien-Hung Huang, Ju-Yuan Hsiao, R.C.T. Lee, Jywe-Fei Fang, "An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes," ispan, pp.80, 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.