Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.12.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023955326 / rank | |||
Normal rank | |||
Revision as of 02:59, 20 March 2024
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
