Abstract
We study the embedding problem of enhanced and augmented hypercubes into complete binary trees. Using tree traversal techniques, we compute the minimum average edge congestion of enhanced and augmented hypercubes into complete binary trees.
| Original language | English |
|---|---|
| Pages (from-to) | 360-366 |
| Number of pages | 7 |
| Journal | Discrete Applied Mathematics |
| Volume | 159 |
| Issue number | 5 |
| DOIs | |
| State | Published - 6 Mar 2011 |
Keywords
- Augmented hypercube
- Average edge congestion
- Complete binary tree
- Embedding
- Enhanced hypercube
- Fixed interconnection parallel architecture
- Folded hypercube
Fingerprint
Dive into the research topics of 'Minimum average congestion of enhanced and augmented hypercubes into complete binary trees'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver