Maximum st-Flow in Directed Planar Graphs via Shortest Paths.

Glencora Borradaile Anna Harutyunyan

Published in: IWOCA (2013)

Keyphrases

shortest path
planar graphs
weighted graph
shortest path algorithm
road network
travel time
geodesic distance
finding the shortest path
minimum weight
information flow
approximate inference
optimal solution
state space
minimum spanning tree