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

}