The complexity of routing in Clos permutation networks (Q4307313)
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 645348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of routing in Clos permutation networks |
scientific article; zbMATH DE number 645348 |
Statements
The complexity of routing in Clos permutation networks (English)
0 references
4 October 1994
0 references
edge-coloring
0 references
network routing
0 references
permutation network
0 references
routing complexity
0 references
lower bounds
0 references
three-stage Clos network
0 references
routing time
0 references
0.88484824
0 references
0 references
0.87959516
0 references
0.8721955
0 references
0.8698032
0 references
