Publisher
Springer International Publishing
Reference14 articles.
1. Łącki, J., Ocwieja, J., Pilipczuk, M., Sankowski, P., Zych, A.: The power of dynamic distance oracles: efficient dynamic algorithms for the steiner tree. In: STOC, pp. 11–20 (2015)
2. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with $${O}(1)$$ worst case access time. J. ACM 31(3), 538–544 (1984). https://doi.org/10.1145/828.1884
3. Lecture Notes in Computer Science;Q-P Gu,2015
4. Henzinger, M.R., Klein, P.N., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3–23 (1997). https://doi.org/10.1006/jcss.1997.1493
5. Klein, P.N.: Preprocessing an undirected planar network to enable fast approximate distance queries. In: SODA, pp. 820–827 (2002)