Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles.
Alexander StrangOliver HaynesRigoberto FlórezDarren A. NarayanPublished in: Bull. ICA (2018)
Keyphrases
- shortest path
- betweenness centrality
- weighted graph
- shortest path problem
- edge weights
- optimal path
- path length
- shortest path algorithm
- path queries
- road network
- edge detection
- minimum cost flow
- travel time
- strongly connected components
- flow graph
- finding the shortest path
- bi objective
- geodesic distance
- graph model
- graph theory
- graph cuts
- level set