Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
R. Sedgewick , Brown University
We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are distances between points). For many graph models, the running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is shown to be O(V) as compared with O (V log V + E) required by the classical (Dijkstra) algorithm.
R. Sedgewick, J.S. Vitter, "Shortest Paths In Euclidean Graphs", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 417-424, doi:10.1109/SFCS.1984.715943