A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217)
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 803316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues |
scientific article; zbMATH DE number 803316 |
Statements
A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (English)
0 references
18 March 1996
0 references
routing algorithm
0 references
packet-routing problem
0 references
queues
0 references
0.88684577
0 references
0.8353265
0 references
0.82176375
0 references
0.8191118
0 references
0.8191118
0 references
0.81441957
0 references
0.8122848
0 references
