24 search results - page 1 / 5 » Partitioning graphs to speedup Dijkstra's algorithm |
JEA
2006
13 years 11 months ago
2006
JEA
2010
13 years 9 months ago
2010
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
ICPP
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
SOFSEM
2009
Springer
14 years 7 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...