A distributed shortest path algorithm for a planar network (Q918205)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A distributed shortest path algorithm for a planar network |
scientific article; zbMATH DE number 4157883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed shortest path algorithm for a planar network |
scientific article; zbMATH DE number 4157883 |
Statements
A distributed shortest path algorithm for a planar network (English)
0 references
1990
0 references
planar network
0 references
distributed computation
0 references
shortest path
0 references
Distributed algorithms
0 references
0.9011489748954772
0 references
0.825424313545227
0 references
0.817650556564331
0 references
0.8149551153182983
0 references
0.8112899661064148
0 references
