On the relation of max-flow to min-cut for generalized networks (Q1122471)
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: On the relation of max-flow to min-cut for generalized networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relation of max-flow to min-cut for generalized networks |
scientific article |
Statements
On the relation of max-flow to min-cut for generalized networks (English)
0 references
1989
0 references
generalized network
0 references
arc multipliers
0 references
maximum flow algorithms
0 references
max-flow min-cut theorem
0 references
