Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time

@article{Thorup1999UndirectedSS,
  title={Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time},
  author={Mikkel Thorup},
  journal={J. ACM},
  year={1999},
  volume={46},
  pages={362-394}
}
The single-source shortest paths problem (SSSP) is one of the classic problems in algorithmic graph theory: given a positively weighted graph G with a source vertex s, find the shortest path from s to all other vertices in the graph. Since 1959, all theoretical developments in SSSP for general directed and undirected graphs have been based on Dijkstra's algorithm, visiting the vertices in order of increasing distance from s. Thus, any implementation of Dijkstra's algorithm sorts the vertices… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 437 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

438 Citations

02040'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 438 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Faster algorithms for the shortest path problem

  • R. K. AHUJA, K. MELHORN, J. B. ORLIN, R. E. TARJAN
  • J. ACM 37, 213–223.
  • 1990
Highly Influential
4 Excerpts

A note on two problems in connection with graphs

  • E. W. DIJKSTRA
  • Numer. Math. 1, 269 –271.
  • 1959
Highly Influential
6 Excerpts

Finding shortest paths in a network

  • E. A. DINIC
  • Transportation Modeling Systems, Y. Popkov and B…
  • 1978
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…