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

Mourad Baou, Francisco Barahona

Browse the full IPCO paper archive.