An oblivious shortest-path routing algorithm for fully connected cubic networks (Q2433302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5068200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An oblivious shortest-path routing algorithm for fully connected cubic networks |
scientific article; zbMATH DE number 5068200 |
Statements
An oblivious shortest-path routing algorithm for fully connected cubic networks (English)
0 references
27 October 2006
0 references
interconnection network
0 references
hierarchical interconnection network
0 references
fully connected cubic network
0 references
routing algorithm
0 references
shortest path
0 references
0.809407651424408
0 references
0.7483460903167725
0 references
0.7483460903167725
0 references
0.7464084625244141
0 references
0.7443991899490356
0 references
