Article ID Journal Published Year Pages File Type
419495 Discrete Applied Mathematics 2011 7 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Authors
,