A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (Q1607102)
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 walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. |
scientific article; zbMATH DE number 1771803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. |
scientific article; zbMATH DE number 1771803 |
Statements
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (English)
0 references
25 July 2002
0 references
0.86368245
0 references
0.85440165
0 references
0.85194075
0 references
0.8513468
0 references
0.84937274
0 references
0.8489102
0 references
0.8484681
0 references
0.8468847
0 references
