Saturating flows in networks

B. S. Chlebus; M. Chrobak; K. Diks

doi:10.1007/3-540-18740-5_22

Saturating flows in networks

B. S. Chlebus, M. Chrobak, K. Diks

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time algorithm solving it. Restricted still farther to s-t outerplanar networks the problem is polynomially solvable.

Original language	English (US)
Title of host publication	Fundamentals of Computation Theory - International Conference, FCT 1987
Editors	Lothar Budach, Rais Gatic Bukharajev, Oleg Borisovic Lupanov
Publisher	Springer Verlag
Pages	82-91
Number of pages	10
ISBN (Print)	9783540187400
DOIs	https://doi.org/10.1007/3-540-18740-5_22
State	Published - Jan 1 1987
Externally published	Yes
Event	International Conference on Fundamentals of Computation Theory, FCT 1987 - Kazan, Russian Federation Duration: Jun 22 1987 → Jun 26 1987

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	278 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Fundamentals of Computation Theory, FCT 1987
Country/Territory	Russian Federation
City	Kazan
Period	6/22/87 → 6/26/87

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-18740-5_22

Cite this

Chlebus, B. S., Chrobak, M., & Diks, K. (1987). Saturating flows in networks. In L. Budach, R. G. Bukharajev, & O. B. Lupanov (Eds.), Fundamentals of Computation Theory - International Conference, FCT 1987 (pp. 82-91). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 278 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18740-5_22

Saturating flows in networks. / Chlebus, B. S.; Chrobak, M.; Diks, K.

Fundamentals of Computation Theory - International Conference, FCT 1987. ed. / Lothar Budach; Rais Gatic Bukharajev; Oleg Borisovic Lupanov. Springer Verlag, 1987. p. 82-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 278 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chlebus, BS, Chrobak, M & Diks, K 1987, Saturating flows in networks. in L Budach, RG Bukharajev & OB Lupanov (eds), Fundamentals of Computation Theory - International Conference, FCT 1987. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 278 LNCS, Springer Verlag, pp. 82-91, International Conference on Fundamentals of Computation Theory, FCT 1987, Kazan, Russian Federation, 6/22/87. https://doi.org/10.1007/3-540-18740-5_22

Chlebus BS, Chrobak M, Diks K. Saturating flows in networks. In Budach L, Bukharajev RG, Lupanov OB, editors, Fundamentals of Computation Theory - International Conference, FCT 1987. Springer Verlag. 1987. p. 82-91. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-18740-5_22

Chlebus, B. S. ; Chrobak, M. ; Diks, K. / Saturating flows in networks. Fundamentals of Computation Theory - International Conference, FCT 1987. editor / Lothar Budach ; Rais Gatic Bukharajev ; Oleg Borisovic Lupanov. Springer Verlag, 1987. pp. 82-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8032b0f7d3444b6e9e4295583e5de4da,

title = "Saturating flows in networks",

abstract = "A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time algorithm solving it. Restricted still farther to s-t outerplanar networks the problem is polynomially solvable.",

author = "Chlebus, {B. S.} and M. Chrobak and K. Diks",

year = "1987",

month = jan,

day = "1",

doi = "10.1007/3-540-18740-5_22",

language = "English (US)",

isbn = "9783540187400",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "82--91",

editor = "Lothar Budach and Bukharajev, {Rais Gatic} and Lupanov, {Oleg Borisovic}",

booktitle = "Fundamentals of Computation Theory - International Conference, FCT 1987",

note = "International Conference on Fundamentals of Computation Theory, FCT 1987 ; Conference date: 22-06-1987 Through 26-06-1987",

}

TY - GEN

T1 - Saturating flows in networks

AU - Chlebus, B. S.

AU - Chrobak, M.

AU - Diks, K.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time algorithm solving it. Restricted still farther to s-t outerplanar networks the problem is polynomially solvable.

AB - A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time algorithm solving it. Restricted still farther to s-t outerplanar networks the problem is polynomially solvable.

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

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

U2 - 10.1007/3-540-18740-5_22

DO - 10.1007/3-540-18740-5_22

M3 - Conference contribution

AN - SCOPUS:84959865861

SN - 9783540187400

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 82

EP - 91

BT - Fundamentals of Computation Theory - International Conference, FCT 1987

A2 - Budach, Lothar

A2 - Bukharajev, Rais Gatic

A2 - Lupanov, Oleg Borisovic

PB - Springer Verlag

T2 - International Conference on Fundamentals of Computation Theory, FCT 1987

Y2 - 22 June 1987 through 26 June 1987

ER -

Saturating flows in networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this