By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chien-Ping Chang ; Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Ting-Yi Sung ; Lih-Hsing Hsu

An n-dimensional crossed cube, CQn, 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(n2) time, our algorithm can generate more shortest paths in O(n) time. Furthermore, we show that CQn is a pancyclic network and we construct various types of cycles of an arbitrary length at least four

Published in:

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference:

18-20 Dec 1997