Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
symposium on discrete algorithms, 2020.
In the decremental single-source shortest paths (SSSP) problem, the input is an undirected graph $G=(V,E)$ with $n$ vertices and $m$ edges undergoing edge deletions, together with a fixed source vertex $s\in V$. The goal is to maintain a data structure that supports shortest-path queries: given a vertex $v\in V$, quickly return an (appr...More
Full Text (Upload PDF)
PPT (Upload PPT)