Engineering Time-Expanded Graphs for Faster Timetable Information [chapter]

Daniel Delling, Thomas Pajor, Dorothea Wagner
2009 Lecture Notes in Computer Science  
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect. Partially supported by the DFG (project WAG54/16-1) and the Future and Emerging Technologies Unit of EC (IST priority
more » ... th FP), under contract no. FP6-021235-2 (project ARRIVAL). 1. The node w is the smallest (regarding time) possible (meaning it is not in violation with the second criterion) arrival node at T that is after u, i.e. w u.
doi:10.1007/978-3-642-05465-5_7 fatcat:u6vzy4yggzfthphx6zrsznlyx4