A new shortest path routing algorithm and embedding cycles of crossed cube

I
ISPAN
1997
1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)
Abstract - A new shortest path routing algorithm and embedding cycles of crossed cube

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Chien-Ping Chang Articles by Ting-Yi Sung Articles by Lih-Hsing Hsu

1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97)

Taipei, Taiwan

December 18-December 20

ISBN: 0-8186-8259-0

	ASCII Text	x
	Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu, "A new shortest path routing algorithm and embedding cycles of crossed cube," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 125, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997.

	BibTex	x
	@article{ 10.1109/ISPAN.1997.645082, author = {Chien-Ping Chang and Ting-Yi Sung and Lih-Hsing Hsu}, title = {A new shortest path routing algorithm and embedding cycles of crossed cube}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {1997}, issn = {1087-4089}, pages = {125}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1997.645082}, 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 - A new shortest path routing algorithm and embedding cycles of crossed cube SN - 1087-4089 SP EP A1 - Chien-Ping Chang, A1 - Ting-Yi Sung, A1 - Lih-Hsing Hsu, PY - 1997 KW - hypercube networks; shortest path routing; crossed cube; embedding cycles; hypercubes; CQ/sub n/; n-dimensional crossed cube; pancyclic network VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Chien-Ping Chang, Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

Ting-Yi Sung, Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

Lih-Hsing Hsu, Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

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

An n-dimensional crossed cube, CQ/sub n/, is a variation of hypercubes. In this paper, we give a new shortest path routing algorithm based on a new distance measure defined herein. In comparison with Efe's algorithm which generates one shortest path in O(n/sup 2/) time, our algorithm can generate more shortest paths in O(n) time. Furthermore, we show that CQ/sub n/ is a pancyclic network and we construct various types of cycles of an arbitrary length at least four.

Index Terms:

hypercube networks; shortest path routing; crossed cube; embedding cycles; hypercubes; CQ/sub n/; n-dimensional crossed cube; pancyclic network

Citation:

Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu, "A new shortest path routing algorithm and embedding cycles of crossed cube," ispan, pp.125, 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 1997

Peer Review Notice | Give Us Feedback

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