Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks.
Dominik KirchlerLeo LibertiRoberto Wolfler CalvoPublished in: ACM J. Exp. Algorithmics (2014)
Keyphrases
- multi modal
- efficient computation
- shortest path
- travel time
- path length
- computational efficiency
- betweenness centrality
- spatial networks
- shortest path algorithm
- edge weights
- multi modality
- road network
- high dimensional
- optimal path
- cross modal
- complex networks
- finding the shortest path
- weighted graph
- geodesic distance
- flow graph
- uni modal