Login / Signup
Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
Philip N. Klein
Shay Mozes
Published in:
CoRR (2010)
Keyphrases
</>
maximum flow
multiple sources
planar graphs
directed graph
flow network
lower bound
data sources
worst case