Login / Signup
Improved algorithms for min cut and max flow in undirected planar graphs.
Giuseppe F. Italiano
Yahav Nussbaum
Piotr Sankowski
Christian Wulff-Nilsen
Published in:
STOC (2011)
Keyphrases
</>
max flow
min cut
energy minimization
undirected graph
graph cuts
pairwise
markov random field
interior point
information theoretic
global optimization
weighted graph
energy function
graph partitioning
potential functions
convex relaxation
lp relaxation