๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embedding incomplete binary trees into incomplete hypercubes

โœ Scribed by Huang, C.-H.; Hsiao, J.-Y.; Lee, R.C.T.


Book ID
114448361
Publisher
The Institution of Electrical Engineers
Year
1998
Tongue
English
Weight
796 KB
Volume
145
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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