A fast algorithm for maximum integral two-commodity flow in planar graphs

Ephraim Korach, Michal Penn

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

We consider in this note the maximum integral two-commodity flow problem in augmented planar graphs, that is with both source-sink edges added. We provide an O(n logn) simple algorithm for finding a maximum integral two-commodity flow in augmented planar graphs.

Original languageEnglish
Pages (from-to)77-83
Number of pages7
JournalDiscrete Applied Mathematics
Volume47
Issue number1
DOIs
StatePublished - 16 Nov 1993
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A fast algorithm for maximum integral two-commodity flow in planar graphs'. Together they form a unique fingerprint.

Cite this