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.
Recommendations
Cites work
Cited in
(9)- A fast algorithm for maximum integral two-commodity flow in planar graphs
- Two commodity flows
- On the integral 4-packing of \(T\)-cuts
- Simple undirected two-commodity integral flow with a unitary demand
- scientific article; zbMATH DE number 1819779 (Why is no real title available?)
- On multicommodity flows in planar graphs
- scientific article; zbMATH DE number 1769310 (Why is no real title available?)
- STACS 2004
- Branch-and-cut for a 2-commodity flow relocation model with time constraints
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)