On node constraint networks
Heinz Gröflin · Networks · 1985
Abstract We give node constraint versions of the circulation theorem and max flow‐min cut and min flow‐max cut theorems, and show how they provide a short and elementary treatment of the problems of finding in a poset an optimum antichain or an optimum convex set.