Undirected Single Source Shortest Paths in Linear Time (1997)
| Venue: | J. Assoc. Comput. Mach |
| Citations: | 43 - 2 self |
BibTeX
@INPROCEEDINGS{Thorup97undirectedsingle,
author = {Mikkel Thorup},
title = {Undirected Single Source Shortest Paths in Linear Time},
booktitle = {J. Assoc. Comput. Mach},
year = {1997},
pages = {12--21}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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, find 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 Dijkstra 's algorithm sorts the vertices according to their distances from s. However, we do not know how to sort in linear time. Here, a deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with integer weights. The algorithm avoids the sorting bottle-neck by building a hierechical bucketing structure, identifying vertex pairs that may be visited in any order. 1 Introduction Let G = (V; E), jV j = n, jEj = m, be an undirected connected graph with an integer edge weight function ` : E ! N and a distinguished source vertex...
