Routing properties of supercubes

Information Sciences

Volumn 131, Issue 1-4, 2001, Pages 107-128

  Sheu, Jyh Jian ^a   Tan, Jimmy J M ^a   Hsu, Lih Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Container; Fault diameter; Hypercube; Interconnection networks; Supercube; Wide diameter

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; SET THEORY;

HYPERCUBES;

INTERCONNECTION NETWORKS;

EID: 0035056587     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(00)00089-X     Document Type: Article

References (14)

1. Embedding graphs onto the supercube
2. Fault tolerant routing in the supercube
3. On container width and length in graphs, groups and networks
4. On the k-diameter of k-regular k-connected graphs
5. Incomplete hypercubes
6. Fault diameter of interconnection networks
7. Topological properties of hypercube
8. Supercube: An optimally fault tolerant network architecture
9. On the routing problem in faulty supercubes
10. The fault diameter of supercubes
11. The shortest routing algorithm for supercube
12. Topological properties of supercube