Decomposing a graph into shortest paths with bounded eccentricity.
Etienne BirmeléFabien de MontgolfierLéo PlancheLaurent ViennotPublished in: Discret. Appl. Math. (2020)
Keyphrases
- shortest path
- weighted graph
- finding the shortest path
- shortest path problem
- flow graph
- path length
- strongly connected components
- edge weights
- betweenness centrality
- graph search
- shortest path algorithm
- minimum cut
- road network
- random walk
- graph model
- graph structure
- optimal path
- graph partitioning
- minimum cost flow
- geodesic distance
- travel time
- minimal surface
- information flow
- shortest distance
- bipartite graph
- dynamic programming