Multiterminal flows and cuts

Gomory and Hu studied minimal collections of cuts in a graph that contain a min cut for every pair of a specified set of terminal nodes. In this node the authors provide a new characterization of these collections of cuts in terms of a generalized notion of a min cut. THey then use this new notion of a min cut to formulate a multiterminal generalization of the well-known max flow/min theorem for the case of undirected graphs.