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

Mourad Baïou, Francisco Barahona. Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Math. Program., 172(1-2):59-75, 2018. [doi]

Abstract

Abstract is missing.