On the planar integer two-flow problem

M. V. Lomonosov

doi:10.1007/BF02579295

On the planar integer two-flow problem

M. V. Lomonosov

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	207-218
Number of pages	12
Journal	Combinatorica
Volume	3
Issue number	2
DOIs	https://doi.org/10.1007/BF02579295
State	Published - 1 Jan 1983
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/BF02579295

Cite this

@article{52902268de9a436284a7f01b44c0e566,

title = "On the planar integer two-flow problem",

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.",

keywords = "AMS subject classification (1980): 90B10, 90C10",

author = "Lomonosov, {M. V.}",

year = "1983",

month = jan,

day = "1",

doi = "10.1007/BF02579295",

language = "English",

volume = "3",

pages = "207--218",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "2",

}

TY - JOUR

T1 - On the planar integer two-flow problem

AU - Lomonosov, M. V.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - 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.

AB - 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.

KW - AMS subject classification (1980): 90B10, 90C10

UR - http://www.scopus.com/inward/record.url?scp=51249183218&partnerID=8YFLogxK

U2 - 10.1007/BF02579295

DO - 10.1007/BF02579295

M3 - Article

AN - SCOPUS:51249183218

SN - 0209-9683

VL - 3

SP - 207

EP - 218

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

On the planar integer two-flow problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this