A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01294128 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027063844 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues |
scientific article |
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
