Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths

Shiri Chechik, Tianyi Zhang. Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 87-99, SIAM, 2023. [doi]

Authors

Shiri Chechik

This author has not been identified. Look up 'Shiri Chechik' in Google

Tianyi Zhang

This author has not been identified. Look up 'Tianyi Zhang' in Google