Decomposing a Graph into Shortest Paths with Bounded Eccentricity.
Etienne BirmeléFabien de MontgolfierLéo PlancheLaurent ViennotPublished in: ISAAC (2017)
Keyphrases
- shortest path
- weighted graph
- finding the shortest path
- shortest path problem
- flow graph
- path length
- edge weights
- strongly connected components
- graph search
- betweenness centrality
- shortest path algorithm
- minimum cut
- graph partitioning
- random walk
- graph model
- optimal path
- travel time
- graph structure
- road network
- spanning tree
- geodesic distance
- maximum flow
- graph theory
- directed graph
- reinforcement learning
- graph databases
- information flow
- spatial networks