Multicommodity flows in planar graphs. (English) Zbl 0465.90029
MSC:
90B10 | Deterministic network models in operations research |
05C35 | Extremal problems in graph theory |
References:
[1] | Ford, L. R.; Fulkerson, D. R., Maximal flow through a network, Canad. J. Math., 8, 399-404 (1956) · Zbl 0073.40203 |
[2] | Hu, T. C., Multi-commodity network flows, Oper. Res., 11, 344-360 (1963) · Zbl 0123.23704 |
[3] | Seymour, P. D., On odd cuts and plane multicommodity flows, (Proc. London Math. Soc., 42 (1981)), 178-192, 3 · Zbl 0447.90026 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.