An analytic symmetrization of max flow-min cut Original Research Article

We use the affine transformation technique proposed in Padberg and Sung (1991) to ‘symmetrize’ the maximum capacitated (s, t)-flow problem and the minimum weighted (s, t)-cut problem in a directed network and derive analytically a version of the max flow-min cut theorem for undirected graphs. This symmetric max flow-min cut theorem turns out to be a capacitated version of the problem studied by Lehman (1979).