Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs

Aaron Bernstein, Shiri Chechik. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 453-469, SIAM, 2017. [doi]

Abstract

Abstract is missing.