Beyersdorff, Olaf; Nebesov, Yevgen
(Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2009)
In this paper we suggest a new approach to timetable information by introducing the "edge-converted graph" of a timetable. Using this model we present simple algorithms that solve the earliest arrival problem (EAP) and the ...