A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities.

Julian Enoch Kyle Fox Dor Mesica Shay Mozes

Published in: ISAAC (2021)

Keyphrases

maximum flow
directed graph
minimum cut
np hard
planar graphs
worst case
minimum weight
objective function
linear programming
expectation maximization
segmentation algorithm
complex networks
undirected graph
linear program
push relabel
convex hull
tree structure
dynamic programming
k means
optimal solution