Max Flow Vulnerability of Undirected Planar Networks.

Lorenzo Balzotti Paolo Giulio Franciosa

Published in: SEBD (2024)

Keyphrases

max flow
min cost
energy minimization
convex programming
graph cuts
pairwise
directed graph
quadratic programming
min cut
graphical models
network structure
undirected graph
convex relaxation