Publisher
Springer International Publishing
Reference31 articles.
1. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37(2), 213–223 (1990)
2. Brodal, G.S.: Worst-case efficient priority queues. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 (1996)
3. Lecture Notes in Computer Science;A Bruun,2010
4. Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(4), 318–334 (1998)
5. Dial, R.B.: Shortest-path forest with topological ordering. Commun. ACM 12(11), 632–633 (1969)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Memory-Restricted Routing with Tiled Map Data;2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC);2018-10