青岛大学学报（自然科学版）2002，Vol.15Issue(1)：19-25,7.
交叉立方体圈嵌入的一个新算法
A NEW ALGORITHM FOR CYCLE-EMBEDDING ON CROSSED CUBES
摘要
Abstract
The recently introduced interconnection network, crossed cube, has severalattractive properties. It was proved that the n-dimensional crossed cube Dn isHamilton-connected when n ＞ 3. An O(llogl)algorithm was given to embed anycycle of length l,4 ≤ l ≤ 2n into Dn with dilation 1 when n ≥ 3 . By usingHamilton-connectivity of the crossed cubes, this paper gives another algorithm to embedany cycle of length l,4 ≤ l ≤ 2 into Dn with dilation 1 when n ≥ 3, whose timecomplexity is O(l).关键词
互连网络/交叉立方体/超立方体/Hamilton连通性/扩张/圈/嵌入Key words
Interconnection network/crossed cube/hypercube/Hamilton-connectivity/dilation/cycle/embedding分类
信息技术与安全科学引用本文复制引用
樊建席,王庆红,刘昕,晁岳壮..交叉立方体圈嵌入的一个新算法[J].青岛大学学报（自然科学版）,2002,15(1):19-25,7.基金项目
本课题得到山东省自然科学基金项目(项目编号:Q99G12)资助. （项目编号:Q99G12）
