An improved Dijkstra's shortest path algorithm for sparse network

DOI10.1016/J.AMC.2006.06.094zbMath1117.65096OpenAlexW1979957675MaRDI QIDQ870157

N. E. Zubov

Publication date: 12 March 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.094

zbMATH Keywords

numerical examplessparse networkscomparison-addition modelDijkstra's shortest path algorithmFibonacci heaproad traffic networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (3)

Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Finding the shortest paths by node combination ⋮ Clifford algebra method for network expression, computation, and algorithm construction

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Improved algorithm for all pairs shortest paths
• A heuristic algorithm for network equilibration
• On a routing problem
• Faster algorithms for the shortest path problem
• An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
• Faster Scaling Algorithms for Network Problems
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: An improved Dijkstra's shortest path algorithm for sparse network