An improvement of Dijkstra's method for finding a shortest path in a graph (Q1072570): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Dual Shortest Path Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest Path and Network Flow Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalized permanent label setting algorithm for the shortest path between specified nodes / rank | |||
Normal rank | |||
Latest revision as of 12:09, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improvement of Dijkstra's method for finding a shortest path in a graph |
scientific article |
Statements
An improvement of Dijkstra's method for finding a shortest path in a graph (English)
0 references
1986
0 references
A slight modification of Dijkstra's original method is presented. If a lower bound on the length of the shortest path between two nodes of a network is known, this modification allows to save up to 35 \% of the computing time which would be required for the original method.
0 references
Dijkstra's algorithm
0 references
shortest path
0 references
