An improved Dijkstra's shortest path algorithm for sparse network

DOI10.1016/J.AMC.2006.06.094zbMATH Open1117.65096OpenAlexW1979957675MaRDI QIDQ870157FDOQ870157

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

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
• 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?)
• Title not available (Why is that?)

Cited In (3)

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

Uses Software

• Algorithm 360

   Recommendations

• Faster algorithms for the shortest path problem 👍 👎
• Title not available (Why is that?) 👍 👎
• A theorem on the expected complexity of dijkstra's shortest path algorithm 👍 👎
• An improvement of Dijkstra's method for finding a shortest path in a graph 👍 👎
• Speeding up dynamic shortest-path algorithms 👍 👎

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)