A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks.

Assaf J. Kfoury

Published in: CoRR (2018)

Keyphrases

maximum flow
search space
dynamic programming
minimum cut
worst case
directed graph
k means
simulated annealing
linear programming
push relabel
social networks
simple polygon
directed networks
flow network
max flow
randomized algorithm
shortest path problem
probabilistic model
np hard
lower bound
optimal solution