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. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Delling, D., Pajor, T., & Wagner, D. (2009). Engineering time-expanded graphs for faster timetable information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5868 LNCS, pp. 182–206). https://doi.org/10.1007/978-3-642-05465-5_7
Mendeley helps you to discover research relevant for your work.