when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-21478
URL:

;

### Edges as Nodes - a New Approach to Timetable Information

 pdf-format:

### Abstract

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.

### BibTeX - Entry

@InProceedings{beyersdorff_et_al:OASIcs:2009:2147,
author =	{Olaf Beyersdorff and Yevgen Nebesov},
title =	{{Edges as Nodes - a New Approach to Timetable Information }},
booktitle =	{9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)},
series =	{OpenAccess Series in Informatics (OASIcs)},
ISBN =	{978-3-939897-11-8},
ISSN =	{2190-6807},
year =	{2009},
volume =	{12},
editor =	{Jens Clausen and Gabriele Di Stefano},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},