On compact representations of All-Pairs-Shortest-Path-Distance matrices.
Paolo FerraginaIgor NittoRossano VenturiniPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- shortest path
- compact representations
- shortest distance
- distance matrix
- geodesic distance
- path length
- shortest path problem
- shortest path algorithm
- routing algorithm
- distance transformation
- road network
- weighted graph
- pairwise
- optimal path
- probabilistic inference
- euclidean distance
- distance function
- flow graph
- path selection
- distance measure
- strongly connected components
- betweenness centrality
- finding the shortest path
- multidimensional scaling
- edge weights
- distance transform
- dynamic programming