18 search results - page 4 / 4 » Point-to-Point Shortest Path Algorithms with Preprocessing |
WEA
2010
Springer
13 years 10 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
IDA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
WEA
2010
Springer
14 years 3 days ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...