Sciweavers

2 search results - page 1 / 1
» Node-disjoint paths in hierarchical hypercube networks
Sort
View
NETWORKS
2002
13 years 4 months ago
Node-disjoint paths and related problems on hierarchical cubic networks
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh
IPPS
2006
IEEE
13 years 11 months ago
Node-disjoint paths in hierarchical hypercube networks
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen