Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs.
Ran DuanKaifeng LyuYuanhang XiePublished in: ICALP (2018)
Keyphrases
- single source
- shortest path problem
- graph structure
- directed graph
- computational complexity
- dynamic programming
- particle swarm optimization
- data mining
- optimization algorithm
- worst case
- np hard
- search space
- simulated annealing
- shortest path
- benchmark problems
- optimal solution
- multi source
- objective function
- databases