Structural properties of incomplete hypercube computers
Nian-Feng Tzeng · 2002
Incomplete hypercubes are analyzed. The elementary properties of complete hypercubes and a routing algorithm for incomplete hypercubes are briefly reviewed. Structural properties, including diameter, mean message traversal, and traffic density, of incomplete hypercube computers with size 2/sup n/+2/sup k/, 0>