Engineering Time-Expanded Graphs for Faster Timetable Information

Daniel Delling, Thomas Pajor, and Dorothea Wagner

Abstract

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.

Details

Publication typeInbook
Pages182–206
Volume5868
PublisherSpringer
> Publications > Engineering Time-Expanded Graphs for Faster Timetable Information