### 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 | |

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 | Russian Federation |

City | Kazan |

Period | 6/22/87 → 6/26/87 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Saturating flows in networks'. Together they form a unique fingerprint.

## 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