Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.
Monika HenzingerSebastian KrinningerDanupon NanongkaiPublished in: J. ACM (2018)
Keyphrases
- shortest path problem
- single source
- shortest path
- undirected graph
- directed graph
- directed acyclic graph
- routing algorithm
- shortest path algorithm
- road network
- approximation algorithms
- graph structure
- random walk
- combinatorial optimization problems
- path length
- connected components
- complex networks
- weighted graph
- minimum cost
- travel time
- spanning tree
- multi dimensional
- optimal solution
- routing problem
- state space
- probability distribution
- data structure