Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
FOCS, pp. 1123-1134, 2020.
Let $G = (V,E,w)$ be a weighted, digraph subject to a sequence of adversarial edge deletions. In the decremental single-source reachability problem (SSR), we are given a fixed source $s$ and the goal is to maintain a data structure that can answer path-queries $s \rightarrowtail v$ for any $v \in V$. In the more general single-source sh...More
PPT (Upload PPT)