Computing isochrones in multi-modal, schedule-based transport networks
暂无分享,去创建一个
[1] Jeffrey Xu Yu,et al. Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.
[2] Ralf Hartmut Güting,et al. Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases , 2006, SAC.
[3] Yang Du,et al. Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[4] Ruihong Huang. A Schedule-based Pathfinding Algorithm for Transit Networks Using Pattern First Search , 2007, GeoInformatica.
[5] Torben Bach Pedersen,et al. Nearest neighbor queries in road networks , 2003, GIS '03.
[6] Jean-Luc Hainaut. Network Data Model , 2008, Encyclopedia of GIS.
[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.