Undirected Single Source Shortest Paths in Linear Time

@inproceedings{ThorupDepartment1997UndirectedSS,
  title={Undirected Single Source Shortest Paths in Linear Time},
  author={Mikkel ThorupDepartment},
  year={1997}
}
  • Mikkel ThorupDepartment
  • Published 1997
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