![Algorithms and Uncertainty_small text_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Uncertainty_hi-res_1.jpg?h=6dcb57f1&itok=7LxcepO0)
Description
Improved *Deterministic* Algorithms for Partially Dynamic Shortest Paths
In this talk I will present the first *deterministic* decremental SSSP algorithm that breaks the Even-Shiloach bound of O(mn) total update time, for unweighted and undirected graphs.
Joint work with: Aaron Bernstein
All scheduled dates:
Upcoming
No Upcoming activities yet