Undirected single-source shortest paths with positive integer weights in linear time

  title={Undirected single-source shortest paths with positive integer weights in linear time},
  author={M. Thorup},
  journal={J. ACM},
  • M. Thorup
  • Published 1999
  • Mathematics, Computer Science
  • J. ACM
  • 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
    392 Citations

    Topics from this paper

    A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
    • 1
    • Highly Influenced
    • PDF
    A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time
    • Highly Influenced
    • PDF
    Directed single-source shortest-paths in linear average-case time
    • 1
    Hybrid Bellman-Ford-Dijkstra algorithm
    • 28
    • PDF
    Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs
    • PDF
    A Shortest Path Algorithm for Real-Weighted Undirected Graphs
    • 76
    • PDF
    A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
    • 9
    • PDF


    A scaling algorithm for weighted matching on general graphs
    • H. Gabow
    • Mathematics, Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 112
    • Highly Influential
    Trans-dichotomous algorithms for minimum spanning trees and shortest paths
    • M. Fredman, D. Willard
    • Computer Science
    • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
    • 1990
    • 215
    • Highly Influential
    • PDF
    Trans-dichotomous algorithms for minimum
    • 1994
    A linear-time algorithm for a special case
    • 1985