Engineering Time-Expanded Graphs for Faster Timetable Information

DOI10.1007/978-3-642-05465-5_7MaRDI QIDQ3649165zbMATH OpenOpenAlexFDO

Authors Daniel Delling, Thomas Pajor, Dorothea Wagner

Publication date 3 December 2009

Published in Robust and Online Large-Scale Optimization (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2008/1582/

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Engineering time-expanded graphs for faster timetable information
• scientific article; zbMATH DE number 2080092
• Engineering graph-based models for dynamic timetable information systems
• Engineering graph-based models for dynamic timetable information systems
• scientific article; zbMATH DE number 1926659
• Algorithms for Extracting Timeliness Graphs
• scientific article; zbMATH DE number 1947425
• Fast and Simple Connectivity in Graph Timelines

Cited in

(10)

• Engineering graph-based models for dynamic timetable information systems
• Dynamic graph generation for the shortest path problem in time expanded networks
• Time-dependent networks as models to achieve fast exact time-table queries
• Towards realistic modeling of time-table information through the time-dependent approach
• Engineering time-expanded graphs for faster timetable information
• Efficient models for timetable information in public transportation systems
• Near optimum paths in time-table graphs
• scientific article; zbMATH DE number 2080092 (Why is no real title available?)
• scientific article; zbMATH DE number 1926659 (Why is no real title available?)
• Engineering graph-based models for dynamic timetable information systems

This page was built for publication: Engineering Time-Expanded Graphs for Faster Timetable Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3649165)