Author:
Peque Genaro,Urata Junji,Iryo Takamasa
Publisher
Springer International Publishing
Reference21 articles.
1. Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
2. Lecture Notes in Computer Science;D Wagner,2007
3. Goldberg, A., Harrelson, C.: Computing the shortest path: A* search meets graph theory. Technical report (2004)
4. Gutman, R.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings 6th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 100–111. SIAM (2004)
5. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: WEA, pp. 319–333 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献