Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing

Aaron Bernstein
Aaron Bernstein
Maximilian Probst Gutenberg
Maximilian Probst Gutenberg

FOCS, pp. 1123-1134, 2020.

Cited by: 0|Bibtex|Views10|DOI:https://doi.org/10.1109/FOCS46700.2020.00108
EI
Other Links: arxiv.org|dblp.uni-trier.de

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments