Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem.

Mourad Baïou Francisco Barahona

Published in: IPCO (2016)

Keyphrases

planar graphs
max cut
approximate inference
bayesian networks
objective function
probability distribution
graphical models
minimum weight
integrality gap