An analytic symmetrization of max flow-min cut
maximum capacitated \((s,t)\)-flow problem
max flow-min cut theorem for undirected graphs
scientific article; zbMATH DE number 1019121
scientific article