Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.

Philip N. Klein Shay Mozes

Published in: WADS (2011)

Keyphrases

maximum flow
multiple sources
planar graphs
flow network
worst case
data sets
databases
directed graph
lower bound
state space
push relabel