Dynamic Detours

Daniel Dadush, Michał Pilipczuk, Amadeus Reinald +2

Fix a parameter $k\in \mathbf{N}$. We give dynamic data structures that for a fully dynamic undirected graph $G$, updated over time by edge insertions and edge deletions, can answe…