On Finding a Shortest Path in Circulant Graphs with Two Jumps.
Domingo GómezJaime GutierrezÁlvar IbeasCarmen MartínezRamón BeividePublished in: COCOON (2005)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- shortest path algorithm
- road network
- graph search
- minimum spanning tree
- routing algorithm
- strongly connected components
- edge weights
- travel time
- markov chain
- optimal path
- path length
- minimal surface
- betweenness centrality
- dijkstra algorithm
- graph partitioning
- geodesic distance
- flow graph
- shortest distance
- steiner tree