Minimum average congestion of enhanced and augmented hypercubes into complete binary trees期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Authors:	Paul Manuel

Institution:	Department of Information Science, Kuwait University, 13060, Kuwait

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:	Fixed interconnection parallel architecture Folded hypercube Enhanced hypercube Augmented hypercube Complete binary tree Embedding Average edge congestion
本文献已被 ScienceDirect 等数据库收录！