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. In Quentin Louveaux, Martin Skutella, editors, Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Volume 9682 of Lecture Notes in Computer Science, pages 63-76, Springer, 2016. [doi]

Abstract

Abstract is missing.