Using multi-level graphs for timetable information in railway systems
From MaRDI portal
Recommendations
- High-performance multi-level routing
- 15. Maintenance of multi-level overlay graphs for timetable queries
- Accelerating time-dependent multi-criteria timetable information is harder than expected
- Engineering time-expanded graphs for faster timetable information
- Engineering Time-Expanded Graphs for Faster Timetable Information
Cited in
(15)- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Computing and listing \(st\)-paths in public transportation networks
- Mvtree for hierarchical network representation based on geometric algebra subspace
- Energy-optimal routes for battery electric vehicles
- 15. Maintenance of multi-level overlay graphs for timetable queries
- Search-space size in contraction hierarchies
- scientific article; zbMATH DE number 3841918 (Why is no real title available?)
- The Shortcut Problem – Complexity and Approximation
- Engineering Route Planning Algorithms
- Engineering Time-Expanded Graphs for Faster Timetable Information
- Connection Scan Algorithm
- Shortest-path queries in static networks
- Computing and listing \(st\)-paths in public transportation networks
- A novel pseudo‐polynomial approach for shortest path problems
- Combining predicted and live traffic with time-dependent A^* potentials
This page was built for publication: Using multi-level graphs for timetable information in railway systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707785)
