Login / Signup
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks
Endre Csóka
Published in:
CoRR (2010)
Keyphrases
</>
maximum flow
minimum cut
dynamic programming
search space
directed graph
optimal solution
segmentation algorithm
directed networks
np hard
simulated annealing
linear programming
energy function
network structure
randomized algorithm
min cut max flow