Finding next-to-shortest paths in a graph.
Ilia KrasikovSteven D. NoblePublished in: Inf. Process. Lett. (2004)
Keyphrases
- shortest path
- weighted graph
- finding the shortest path
- shortest path problem
- flow graph
- path length
- strongly connected components
- edge weights
- shortest path algorithm
- graph search
- minimum cut
- betweenness centrality
- random walk
- travel time
- road network
- dynamic programming
- graph structure
- geodesic distance
- information flow
- minimum cost flow
- directed graph
- spanning tree
- directed acyclic graph
- minimal surface
- graph theory
- connected components
- optimal solution