Sciweavers

NETWORKS
2002
14 years 3 days 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