Distance formula and shortest paths for the (n, k)-star graphs.
Eddie ChengJerrold W. GrossmanLászló LiptákKe QiuZhizhang ShenPublished in: Inf. Sci. (2010)
Keyphrases
- shortest path
- finding the shortest path
- shortest distance
- weighted graph
- edge weights
- path length
- geodesic distance
- shortest path problem
- shortest path algorithm
- betweenness centrality
- graph search
- road network
- strongly connected components
- distance transformation
- minimal surface
- euclidean distance
- distance measure
- graph partitioning
- travel time
- graph theory
- neighborhood sequences
- distance metric
- distance function
- optimal path
- small world
- distance matrix
- spanning tree
- flow graph
- distance transform
- approximation algorithms