Incomplete Hypercubes: Embeddings of Tre
β
S. Ohring; S.K. Das
π
Article
π
1995
π
Elsevier Science
π
English
β 911 KB
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