Shortest Paths in Distance-regular Graphs.
Enrique BenditoÁngeles CarmonaAndrés M. EncinasPublished in: Eur. J. Comb. (2000)
Keyphrases
- shortest path
- finding the shortest path
- shortest distance
- weighted graph
- path length
- edge weights
- geodesic distance
- graph search
- shortest path algorithm
- strongly connected components
- shortest path problem
- betweenness centrality
- distance transformation
- road network
- optimal path
- dynamic programming
- travel time
- graph theory
- graph partitioning
- minimal surface
- bipartite graph
- distance metric
- neighborhood sequences
- euclidean distance
- distance function
- directed acyclic graph
- distance matrix
- flow graph
- minimum cost flow
- np complete