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 Euclidean distances between points). For many graph models, the average 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(E plus V log V) required by the classical algorithm due to E. W. Dijkstra.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 31-48 |
| Number of pages | 18 |
| Journal | Algorithmica (New York) |
| Volume | 1 |
| Issue number | 1 |
| State | Published - 1986 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Applied Mathematics
- Computer Science Applications