Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs.

Adam Karczmarz Piotr Sankowski

Published in: ICALP (2023)

Keyphrases

shortest path
shortest path problem
shortest path algorithm
high dimensional
optimal path
sparse representation
road network
weighted graph
travel time
flow graph
shortest distance
dynamic environments
geodesic distance
minimum cost flow