Shortest path and maximum flow problems in planar flow networks with additive gains and losses.
Saber MirzaeiAssaf J. KfouryPublished in: CoRR (2016)
Keyphrases
- shortest path
- shortest path problem
- maximum flow
- minimum cut
- minimum cost flow
- finding the shortest path
- shortest path algorithm
- path length
- optimization problems
- flow network
- social networks
- combinatorial optimization problems
- road network
- power law
- routing algorithm
- path selection
- flow graph
- betweenness centrality