Oana Georgescu and Eleonor Ciurea: Minimum flows in directed s-t planar networks p.305-313

Abstract:

We present an algorithm for finding maximum cut and an algorithm for minimum flow in directed $s$-$t$ planar networks. Finally, we present an example for these two algorithms.

Key Words: Network flow, network algorithms, minimum flow problem, planar graphs.

2000 Mathematics Subject Classification: Primary: 90B10;
Secondary: 90C35, 05C35, 68R10.

Download the paper in pdf format here.