We consider the two-commodity flow problem and give a good characterization of the optimum flow if the augmented network (with both source-sink edges added) is planar. We show that max flow ≧ min cut -1, and describe the structure of those networks for which equality holds.
- AMS subject classification (1980): 90B10, 90C10
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics