Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs.
Ran DuanKaifeng LyuHongxun WuYuanhang XiePublished in: CoRR (2018)
Keyphrases
- single source
- shortest path problem
- shortest path
- cost function
- neural network
- optimization algorithm
- optimal solution
- worst case
- database
- dynamic programming
- np hard
- search space
- computational complexity
- objective function
- data sets
- simulated annealing
- sparse representation
- evolutionary computation
- combinatorial optimization
- graph structure