Computing isochrones in multi-modal, schedule-based transport networks
Open Access
- 5 November 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding time-dependent shortest paths over large graphs2008
- A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First SearchGeoInformatica, 2007
- Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases2006
- Finding Fastest Paths on A Road Network with Speed Patterns2006
- Nearest neighbor queries in road networks2003
- A note on two problems in connexion with graphsNumerische Mathematik, 1959