It is shown that a maximum multicommodity flow on a class of directed networks, called dominance networks, can be obtained by successively solving single commodity flow problems. Also the max-flow min-cut theorem holds on these directed networks. Certain series-parallel directed networks are shown to be a subclass of dominance networks.
展开▼
