Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
Open Access
- 1 February 2004
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 92, 3-15
- https://doi.org/10.1016/j.entcs.2003.12.019
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Formal-Language-Constrained Path ProblemsSIAM Journal on Computing, 2000
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990