# Edges as Nodes - a New Approach to Timetable Information

Beyersdorff, O and Nebesov, Y (2009) Edges as Nodes - a New Approach to Timetable Information. In: ATMOS 2009. Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), 10 September 2009, University of Cophenhagen, Denmark. Dagstuhl Research Online Publication Server (DROPS) . ISBN 978-3-939897-11-8

Full text available as:
 Preview
Text
ATMOS09-timetable.pdf
Available under licence : See the attached licence file.

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 minimum number of transfers problem (MNTP). For constant-degree graphs this yields linear-time algorithms for EAP and MNTP which improves upon the known \emph{Dijkstra}-based approaches. We also test the performance of our algorithms against the classical algorithms for EAP and MNTP in the time-expanded model.