Parallel computation of best connections in public transportation networks


Exploiting parallelism in route planning algorithms is a challenging algorithmic problem with obvious applications in mobile navigation and timetable information systems. In this work, we present a novel algorithm for the one-to-all <i>profile-search</i> problem in public transportation networks. It answers the question for all fastest connections between a… (More)
DOI: 10.1145/2133803.2345678


6 Figures and Tables


Citations per Year

Citation Velocity: 17

Averaging 17 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Delling2010ParallelCO, title={Parallel computation of best connections in public transportation networks}, author={Daniel Delling and Bastian Katz and Thomas Pajor}, journal={2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)}, year={2010}, pages={1-12} }