A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks.
Thomas A. WilliamsGregory P. WhitePublished in: J. ACM (1973)
Keyphrases
- path length
- shortest path
- finding the shortest path
- shortest distance
- dynamic programming
- minimum length
- shortest path problem
- shortest path algorithm
- optimal path
- geodesic distance
- edge weights
- distance matrix
- weighted graph
- distance function
- expectation maximization
- np hard
- optimal solution
- distance transform
- betweenness centrality
- objective function
- image sequences
- data points
- distance transformation
- flow graph