An algorithm is given to fmd maxtmum two-commodity flow m an undirected graph The algorithm is an improvement on Hu's two-commodity flow algorithm using the methods of Dmlc's single-commodity flow algorithm Karzanov's Improvement of Dmlc's algorithm can be applied to yield an O(I V ] 3) algorithm.
No takes yet. Share an insight, caveat, or question.
Alon Itai (1978) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: