Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum average congestion of enhanced and augmented hypercubes into complete binary trees |
scientific article |
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
