An analytic symmetrization of max flow-min cut (Q1356775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analytic symmetrization of max flow-min cut |
scientific article; zbMATH DE number 1019121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analytic symmetrization of max flow-min cut |
scientific article; zbMATH DE number 1019121 |
Statements
An analytic symmetrization of max flow-min cut (English)
0 references
10 June 1997
0 references
maximum capacitated \((s,t)\)-flow problem
0 references
minimum weighted \((s,t)\)-cut problem
0 references
directed network
0 references
max flow-min cut theorem for undirected graphs
0 references
