On the planar integer two-flow problem

M. V. Lomonosov

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We consider the two-commodity flow problem and give a good characterization of the optimum flow if the augmented network (with both source-sink edges added) is planar. We show that max flow ≧ min cut -1, and describe the structure of those networks for which equality holds.

Original languageEnglish
Pages (from-to)207-218
Number of pages12
JournalCombinatorica
Volume3
Issue number2
DOIs
StatePublished - 1 Jun 1983
Externally publishedYes

Keywords

  • AMS subject classification (1980): 90B10, 90C10

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'On the planar integer two-flow problem'. Together they form a unique fingerprint.

Cite this