Finding the most vital node of a shortest path.
Enrico NardelliGuido ProiettiPeter WidmayerPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- shortest path
- path length
- shortest distance
- finding the shortest path
- optimal path
- shortest path algorithm
- source node
- shortest path problem
- betweenness centrality
- road network
- routing algorithm
- edge weights
- flow graph
- weighted graph
- travel time
- dijkstra algorithm
- steiner tree
- evolutionary algorithm
- strongly connected components
- dynamic programming
- path queries
- social networks