Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs.

David Eisenstat Philip N. Klein

Published in: STOC (2013)

Keyphrases

shortest path
max flow
planar graphs
multiple sources
worst case
graphical models
integer programming
high dimensional
combinatorial optimization
weighted graph
approximate inference