Maximum concurrent flows and minimum cuts
From MaRDI portal
Publication:1194345
DOI10.1007/BF01758845zbMath0762.90024MaRDI QIDQ1194345
Publication date: 27 September 1992
Published in: Algorithmica (Search for Journal in Brave)
90B10: Deterministic network models in operations research
Cites Work
- Unnamed Item
- Combinatorial approaches to multiflow problems
- Multi-terminal maximum flows in node-capacitated networks
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Maximal Flow Through a Network
- The maximum concurrent flow problem
- Solution Bases of Multiterminal Cut Problems
- Multi-Terminal Network Flows
- Circular Cuts in a Network
- An Efficient Heuristic Procedure for Partitioning Graphs
- Multi-Commodity Network Flows