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

被引：4

作者：

Chang, CP ^{[1
]}

Sung, TY ^{[1
]}

Hsu, LH ^{[1
]}

机构：

[1] Natl Chiao Tung Univ, Dept Comp & Informat Sci, Hsinchu 30050, Taiwan

来源：

THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97) | 1997年

关键词：

D O I：

10.1109/ISPAN.1997.645082

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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

引用

页码：125 / 131

页数：7