Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to journal › Article › peer-review

44 Scopus citations

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 languageEnglish
Pages (from-to)360-366
Number of pages7
JournalDiscrete Applied Mathematics
Volume159
Issue number5
DOIs
StatePublished - 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