Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum average congestion of enhanced and augmented hypercubes into complete binary trees |
scientific article; zbMATH DE number 5864314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum average congestion of enhanced and augmented hypercubes into complete binary trees |
scientific article; zbMATH DE number 5864314 |
Statements
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (English)
0 references
10 March 2011
0 references
fixed interconnection parallel architecture
0 references
folded hypercube
0 references
enhanced hypercube
0 references
augmented hypercube
0 references
complete binary tree
0 references
embedding
0 references
average edge congestion
0 references
0 references
0 references
0.86588454
0 references
0.8648031
0 references
0 references
0.8621138
0 references
0.8619546
0 references
0.86060596
0 references
0.85902935
0 references
0.85720944
0 references
