Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights.
Sanjiang LiYongming LiPublished in: CoRR (2019)
Keyphrases
- shortest path
- directed graph
- edge weights
- shortest path algorithm
- shortest path problem
- minimum spanning tree
- optimization problems
- strongly connected
- worst case
- minimum cost flow
- path length
- combinatorial optimization problems
- reverse nearest neighbor
- maximum flow
- data structure
- weighted graph
- road network
- dynamic environments
- nearest neighbor