An improvement of Dijkstra's method for finding a shortest path in a graph
From MaRDI portal
Publication:1072570
DOI10.1016/0166-218X(86)90072-7zbMath0587.05042MaRDI QIDQ1072570
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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