Login / Signup
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs.
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
Published in:
STOC (2014)
Keyphrases
</>
shortest path problem
shortest path
single source
directed graph
shortest path algorithm
minimum cost flow
maximum flow
strongly connected components
combinatorial optimization problems
multi source
databases
database systems
search algorithm
connected components
strongly connected
finding the shortest path