An improvement of Dijkstra's method for finding a shortest path in a graph

DOI10.1016/0166-218X(86)90072-7zbMath0587.05042MaRDI QIDQ1072570

Jean Bovet

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

shortest pathDijkstra's algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items

A parallel shortest path algorithm, Estimation and determination of shortest path length in a road network with obstacles, Solving k-shortest and constrained shortest path problems efficiently

Cites Work

• A note on two problems in connexion with graphs
• A generalized permanent label setting algorithm for the shortest path between specified nodes
• Shortest Path and Network Flow Algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A Dual Shortest Path Algorithm