Four-terminus flows

DOI10.1002/net.3230100108zbMath0432.90029OpenAlexW2085035171MaRDI QIDQ3870642

P. D. Seymour

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100108

zbMATH Keywords

flows in networks2-commodity flow theoremfour-terminus flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Three commodity flows in graphs, The parsimonious property of cut covering problems and its applications, On fractional multicommodity flows and distance functions, Distances and cuts in planar graphs, When Do Gomory--Hu Subtrees Exist?, A \(T_X\)-approach to some results on cuts and metrics, Cut-sufficient directed 2-commodity multiflow topologies, Disjoint paths in graphs, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, Criticality for multicommodity flows, On the tractability of some natural packing, covering and partitioning problems, Short proofs on multicommodity flows and cuts, Disjoint paths in graphs. (Reprint), Half-integral five-terminus flows, Projections of the capacitated network loading problem, Metrics and undirected cuts