@inproceedings{436d457175f94e789c85b192ddae7abd,
title = "Shortest paths in euclidean graphs",
abstract = "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.",
author = "Robert Sedgewick and Vitter, \{Jeffrey Scott\}",
note = "Publisher Copyright: {\textcopyright} 1984 IEEE.; 25th Annual Symposium on Foundations of Computer Science, FOCS 1984 ; Conference date: 24-10-1984 Through 26-10-1984",
year = "1984",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "417--424",
booktitle = "25th Annual Symposium on Foundations of Computer Science, FOCS 1984",
address = "United States",
}