Maximum concurrent flows and minimum cuts

DOI10.1007/BF01758845zbMath0762.90024OpenAlexW2001646664MaRDI QIDQ1194345

S. Singh

Publication date: 27 September 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758845

zbMATH Keywords

multicommodity flow\(k\)-way partitionsminimum cost cuts

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Dynamic programming and graph optimization problems ⋮ An algorithm for computing maximum solution bases ⋮ Minimizing symmetric submodular functions

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

This page was built for publication: Maximum concurrent flows and minimum cuts