Login / Signup
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
Shay Mozes
Published in:
CoRR (2010)
Keyphrases
</>
multiple sources
maximum flow
planar graphs
flow network
lower bound
directed graph
data sets
database systems
prior knowledge
dynamic programming