62 citations · 316 across the 38 of their papers we have counts for
1 paper · 1 filter
Adam Karczmarz, Piotr Sankowski
We study the exact fully dynamic shortest paths problem. For real-weighted directed graphs, we show a deterministic fully dynamic data structure with O~(mn4/5) worst-ca…