R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks.
Paolo D'AlbertoAlexandru NicolauPublished in: Algorithmica (2007)
Keyphrases
- shortest path
- shortest path problem
- path length
- shortest path algorithm
- weighted graph
- optimal solution
- finding the shortest path
- optimal path
- dynamic programming
- online social networks
- network structure
- graph model
- travel time
- path planning
- multi dimensional
- minimum spanning tree
- shortest distance
- objective function