New algorithms and hardness for incremental single-source shortest paths in directed graphs.
Maximilian Probst GutenbergVirginia Vassilevska WilliamsNicole WeinPublished in: STOC (2020)
Keyphrases
- shortest path problem
- shortest path
- single source
- directed graph
- shortest path algorithm
- minimum cost flow
- computational complexity
- strongly connected
- random walk
- strongly connected components
- maximum flow
- worst case
- optimization problems
- data warehouse
- weighted graph
- np hard
- data model
- query processing
- minimal surface
- evolutionary algorithm
- bayesian networks
- database systems
- data sets