A minimum-hop routing algorithm based on distributed information (Q4207595): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0169-7552(89)90011-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986647006 / rank | |||
Normal rank | |||
Latest revision as of 21:51, 19 March 2024
scientific article; zbMATH DE number 4128412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum-hop routing algorithm based on distributed information |
scientific article; zbMATH DE number 4128412 |
Statements
A minimum-hop routing algorithm based on distributed information (English)
0 references
1989
0 references
routing
0 references
distributed algorithms
0 references
minimum-hop
0 references
network
0 references
shortest-path
0 references
