Undirected Single Source Shortest Path in Linear Time

  title={Undirected Single Source Shortest Path in Linear Time},
  author={Mikkel Thorup},
The single source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a weighted graph G with a source vertex s, nd the shortest path from s to all other vertices in the graph. Since 1959 all theoretical developments in SSSP have been based on Dijkstra's algorithm, visiting the vertices in order of increasing distance from s. Thus, any implementation of Dijk-stra's algorithm sorts the vertices according to their distances from s. However, we do not… CONTINUE READING
27 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 27 extracted citations


Publications referenced by this paper.
Showing 1-10 of 17 references

Faster ShortestPath Algorithmsfor Planar Graphs

  • P. Klein, S. Rao, S. Subramanian.
  • J . Comp . Syst . Sc .
  • 1997

Fusion trees can be implemented withAC 0 instructions only

  • P. B. Miltersen, M. Thorup.
  • 1996

On RAM priority queues

  • P. van Emde Boas
  • Proceedings of the 7 th ACMSIAM Symposium…
  • 1996

Faster algorithms for the shortestpath problem

  • R. K. Ahuja, K. Melhorn, J. B. Orlin, R. E. Tarjan
  • J . ACM
  • 1990

Similar Papers

Loading similar papers…