
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24October 26
ISBN: 081860591X
ASCII Text  x  
R. Sedgewick, J.S. Vitter, "Shortest Paths In Euclidean Graphs," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 417424, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984.  
BibTex  x  
@article{ 10.1109/SFCS.1984.715943, author = {R. Sedgewick and J.S. Vitter}, title = {Shortest Paths In Euclidean Graphs}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1984}, isbn = {081860591X}, pages = {417424}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715943}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Shortest Paths In Euclidean Graphs SN  081860591X SP417 EP424 A1  R. Sedgewick, A1  J.S. Vitter, PY  1984 VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
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.
Citation:
R. Sedgewick, J.S. Vitter, "Shortest Paths In Euclidean Graphs," focs, pp.417424, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.