A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths (Q3889092)
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 Dijkstra-like shortest path algorithm for certain cases of negative arc lengths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths |
scientific article |
Statements
A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths (English)
0 references
1980
0 references
shortest path
0 references
digraph
0 references
algorithm
0 references
