Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.

Mourad Baïou Francisco Barahona

Published in: Math. Program. (2018)

Keyphrases

planar graphs
max cut
approximate inference
minimum weight
undirected graph
belief propagation
special case
linear programming
graph model
integrality gap