1. Wei, F.: TEDI: Efficient shortest path query answering on graphs. In: SIGMOD’10 (2010)
2. Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: EDBT’09 (2009)
3. Goldberg, A.V., Kaplan, H., Werneck, R.: Reach for A*: efficient point-to-point shortest path algorithms. In: Workshop on Algorithm Engineering and Experiments, pp. 129–143 (2006)
4. Arge, L., Meyer, U., Toma, L.: External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 146–157. Springer, Heidelberg (2004)
5. Gutman, R.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings of the 6th International Workshop on Algorithm Engineering and Experiments, pp. 100–111 (2004)