Title of article
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees Original Research Article
Author/Authors
Paul Manuel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
360
To page
366
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
Complete binary tree , Embedding , Augmented hypercube , Average edge congestion , Fixed interconnection parallel architecture , Folded hypercube , Enhanced hypercube
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887580
Link To Document