Structural and tree embedding aspects of incomplete hypercubes
โ Scribed by Nian-Feng Tzeng; Hsing-Lung Chen
- Book ID
- 119772271
- Publisher
- IEEE
- Year
- 1994
- Tongue
- English
- Weight
- 711 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0018-9340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider the incomplete hypercubes, a generalization of the binary hypercube networks in the sense that the number of nodes can be arbitrary as opposed to a strict power of 2 . The capability of the incomplete hypercubes to execute parallel programs is studied here using graph embedding technique
Tien, J.-Y. and W.-P. Yang, Hierarchical spanning trees and distributing on incomplete hypercubes, Parallel Computing 17 (1991) 1343-1360\_ Incomplete hypercubes are gaining increasing attention as one of the possible solutions for the limitation on the number of nodes in the hypercubes. Distributi