Shortest Paths In Euclidean Graphs

R. Sedgewick, J.S. Vitter
25th Annual Symposium onFoundations of Computer Science, 1984.  
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(V1ogV + E ) required by the classical (Dijkstra) algorithm.
doi:10.1109/sfcs.1984.715943 dblp:conf/focs/SedgewickV84 fatcat:vvdggikdffe5piek4gdeqydeo4