论文部分内容阅读
交叉立方体互联网络有不少独特的性质。已经证明当3n时n维交叉立方体nD是Hamilton连通的,一个将长度)24(,nll的圈以扩张1嵌入nD的)log(llO算法。本文利用交叉立方体的Hamilton连通性给出了一个将长度nll24,的圈以扩张1嵌入nD的新的算法也被给出,其时间复杂度为)(lO。
Cross-cube Internet has many unique properties. It has been shown that the n-dimensional crisscross cube nD is a Hamiltonian at 3n, a log (llO) algorithm that takes a length of 24 (, the circle of nll is dilated by 1). The Hamiltonian of crossed cubes is given in this paper. A new algorithm for embedding nD in a ring of length n114, with an expansion of 1, is also given, with a time complexity of (10).