Shortest paths in conservative graphs.
Michele ConfortiRomeo RizziPublished in: Discret. Math. (2001)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path algorithm
- shortest path problem
- strongly connected components
- edge weights
- betweenness centrality
- road network
- optimal path
- graph search
- travel time
- geodesic distance
- path length
- graph mining
- shortest distance
- flow graph
- dynamic programming
- graph partitioning
- spanning tree
- minimal surface
- minimum cost flow
- high dimensional
- small world
- bipartite graph