An improved Dijkstra's shortest path algorithm for sparse network
DOI10.1016/J.AMC.2006.06.094zbMATH Open1117.65096OpenAlexW1979957675MaRDI QIDQ870157FDOQ870157
Authors: 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
Recommendations
numerical examplessparse networkscomparison-addition modelDijkstra's shortest path algorithmFibonacci heaproad traffic networks
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Faster Scaling Algorithms for Network Problems
- Title not available (Why is that?)
- Faster algorithms for the shortest path problem
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Improved algorithm for all pairs shortest paths
- A heuristic algorithm for network equilibration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Clifford algebra method for network expression, computation, and algorithm construction
- A theorem on the expected complexity of dijkstra's shortest path algorithm
- Finding the shortest paths by node combination
- Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
- An improvement of Dijkstra's method for finding a shortest path in a graph
- Faster algorithms for the shortest path problem
Uses Software
This page was built for publication: An improved Dijkstra's shortest path algorithm for sparse network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870157)
