Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210–236 (1999)
2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
3. Erwig, M.: The graph Voronoi diagram with applications. Networks 36(3), 156–163 (2000)
4. Gaboille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms 53(1), 85–112 (2004)
5. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA, pp. 156–165 (2005)