Events
Fall 2016

Uncertainty Whiteboard Seminar
Dec 9, 2016 2:30 pm – 5:00 pm
Parent Program:
Speaker:
Location:
Calvin Lab Rm 116
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