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

Post date: Jun 21, 2016 8:48:52 PM

Mourad Baıou and Francisco Barahona, IPCO 2016