Parallel computation of best connections in public transportation networks

DOI10.1145/2133803.2345678zbMath1284.05281OpenAlexW2021134775MaRDI QIDQ5406283

Daniel Delling, Thomas Pajor, Bastian Katz

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000012903/975304

zbMATH Keywords

shortest pathsroute planningpublic transportationprofile queries

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Large-scale problems in mathematical programming (90C06) Traffic problems in operations research (90B20) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Trip-Based Public Transit Routing ⋮ Connection Scan Algorithm ⋮ User-Constrained Multimodal Route Planning

This page was built for publication: Parallel computation of best connections in public transportation networks