DocumentCode :
3171918
Title :
Shortest Paths In Euclidean Graphs
Author :
Sedgewick, Robert ; Vitter, Jeffrey Scott
Author_Institution :
Brown University
fYear :
1984
fDate :
24-26 Oct 1984
Firstpage :
417
Lastpage :
424
Keywords :
Circuits; Computer science; Euclidean distance; Search problems; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
ISSN :
0272-5428
Print_ISBN :
0-8186-0591-X
Type :
conf
DOI :
10.1109/SFCS.1984.715943
Filename :
715943
Link To Document :
بازگشت