On the integral plane two-commodity flow problem

From MaRDI portal





The authors consider the maximum integral two-commodity flow problem in augmented planar graphs, that is, with both source and sink edges added. An \(O(n\log n)\) simple algorithm is provided to determine the minimal increase in the weight function required to ensure that the value of a maximum plane integral two-commodity flow equals the value of the maximum plane two-commodity flow with both values equal to the original maximum two-commodity flow value.











This page was built for publication: On the integral plane two-commodity flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197891)