1) hypercube interconnection
超立方体连接
3) hypercube
['haipə,kju:b]
超立方体
1.
On the distinguishing number of the cube of the hypercube;
超立方体三次幂的可区别数研究
2.
Utilizing OPSBOPMs to realize a fault-tolerant routing strategy in hypercube system;
用OPSBOPMs实现超立方体系统的容错路由
3.
Embedding the hypercube into the twisted cube connected network;
扭立方体连接网络中超立方体的嵌入
4) Hypercubes
超立方体
1.
Optimal Broadcast in All-port Wormhole-routed Hypercubes;
全端口虫蚀寻径超立方体上的优化广播
2.
In illustration of this result, circulants, hypercubes, generalized hypercubes, toroidal.
作为实例 ,指明循环网络、超立方体、广义超立方体、超环面和立方连通圈等都是Cayley图 。
5) twisted cube connected network
扭立方体连接网络
1.
In this paper, based on the routing algorithm presented in [1],the broadcasting algorithms in the twisted cube connected networks are presented for the single port and the multi port I/O models.
根据文献 [1 ]中给出的路由算法 ,提出了单端口 I/O与多端口 I/O两种模型下扭立方体连接网络上的广播算法 ,并证明了这些算法是广播步数最小的算法 。
2.
In this paper, based on the recursive property, it is proved that there are k binomial tree subgraphs in the twisted cube connected network, that is, k binomial trees can be embedded into the twisted cube connected network with dilation 1, congestion 1 and load 1 (0≤ k≤n ).
根据扭立方体连接网络结构的递归性 ,证明了 n维扭立方体连接网络中存在以任意顶点为根结点的k阶二项树子图 ,也就是说 k阶二项树可以最小的扩张、拥塞度和负载嵌入到 n维扭立方体连接网络中 ( 0≤ k≤n
3.
Based on the recursive property of twisted cube connected networks, this paper studies the problem of embedding the hypercube into the twisted cube connected network.
扭立方体连接网络是超立方体的一个变种，它具有良好的结构递归性和较理想的网络参数。
6) cube-connected cycle
立方连接圈
补充资料：Hilbert立方体
Hilbert立方体
Hflbert cube
s沁口目s脚止)).这是一个内容丰富成果丰硕的研究领域. 【AI]中有绝好的介绍及参考文献.1翻卜时立方体〔f口加时。谕.;几几诵epT佃二.钾.，l HIIb叮空间(托1饮成sP别笼)l:的子空间，它的点x一(xl，xZ，…)满足条件0‘x，‘(合)一，，2，·…Hilbert立方体是一个紧统(印代甲aCtllnl)，拓扑等价(同胚)于可数多个区间的T叮oHoB积，即毛盯OHo.立方体(T泪如加v CUbe)I从。.这是具有可数基的度量空间类中的万有空间(u苗记岛沮sp即笼)(yP“coH摩粤化定理(Ul笋ohnn毖tri皿山nd笙幻reln)). B .A.nac卜川劝B撰【补注】到山比d立方体的拓扑结构是在无穷维拓扑这一领域内得到研究的(见无穷维空间(而丽记~dinrn-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条