Author:
Sanders Peter,Schultes Dominik
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
2. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165 (2005)
3. Willhalm, T.: Engineering Shortest Path and Layout Algorithms for Large Graphs. PhD thesis, Technische Universität Karlsruhe (2005)
4. Fakcharoenphol, J., Rao, S.: Negative weight edges, shortest paths, near linear time. In: 42nd Symposium on Foundations of Computer Science, pp. 232–241 (2001)
5. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42nd Symposium on Foundations of Computer Science, pp. 242–251 (2001)
Cited by
120 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献