Edges as nodes - A new approach to timetable information

Download statistics - Document (COUNTER):

Beyersdorff, O.; Nebesov, Y.: Edges as nodes - A new approach to timetable information. In: OpenAccess Series in Informatics 12 (2009). DOI: https://doi.org/10.4230/OASIcs.ATMOS.2009.2147

Repository version

To cite the version in the repository, please use this identifier: https://doi.org/10.15488/1470

Selected time period:

year: 
month: 

Sum total of downloads: 32




Thumbnail
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 DIJKSTRA-based approaches. We also test the performance of our algorithms against the classical algorithms for EAP and MNTP in the time-expanded model.
License of this version: CC BY 3.0
Document Type: article
Publishing status: publishedVersion
Issue Date: 2009
Appears in Collections:Fakultät für Elektrotechnik und Informatik

distribution of downloads over the selected time period:

downloads by country:

pos. country downloads
total perc.
1 image of flag of Germany Germany 31 96.88%
2 image of flag of China China 1 3.12%

Further download figures and rankings:


Hinweis

Zur Erhebung der Downloadstatistiken kommen entsprechend dem „COUNTER Code of Practice for e-Resources“ international anerkannte Regeln und Normen zur Anwendung. COUNTER ist eine internationale Non-Profit-Organisation, in der Bibliotheksverbände, Datenbankanbieter und Verlage gemeinsam an Standards zur Erhebung, Speicherung und Verarbeitung von Nutzungsdaten elektronischer Ressourcen arbeiten, welche so Objektivität und Vergleichbarkeit gewährleisten sollen. Es werden hierbei ausschließlich Zugriffe auf die entsprechenden Volltexte ausgewertet, keine Aufrufe der Website an sich.

Search the repository


Browse