Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.
Franz-Josef BrandenburgMao-cheng CaiPublished in: FAW (2009)
Keyphrases
- shortest path
- maximum flow
- shortest path problem
- minimum cut
- shortest path algorithm
- path length
- road network
- weighted graph
- steiner tree
- minimum cost flow
- routing algorithm
- travel time
- social networks
- path selection
- flow graph
- directed networks
- edge weights
- directed graph
- betweenness centrality
- finding the shortest path