Engineering time-expanded graphs for faster timetable information
From MaRDI portal
Publication:2917364
DOI10.4230/OASICS.ATMOS.2008.1582zbMATH Open1247.90156OpenAlexW2570187103MaRDI QIDQ2917364FDOQ2917364
Authors: Daniel Delling, Thomas Pajor, Dorothea Wagner 
Publication date: 28 September 2012
Full work available at URL: https://dblp.uni-trier.de/db/conf/atmos/atmos2008.html#DellingPW08
Recommendations
- Engineering Time-Expanded Graphs for Faster Timetable Information
- Efficient models for timetable information in public transportation systems
- Engineering graph-based models for dynamic timetable information systems
- Accelerating time-dependent multi-criteria timetable information is harder than expected
- Time-dependent networks as models to achieve fast exact time-table queries
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cited In (9)
- Title not available (Why is that?)
- Engineering Time-Expanded Graphs for Faster Timetable Information
- Efficient models for timetable information in public transportation systems
- Dynamic graph generation for the shortest path problem in time expanded networks
- Title not available (Why is that?)
- Near optimum paths in time-table graphs
- 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 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 Q2917364)
