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: Publication:1122471 |
scientific article; zbMATH DE number 4106577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relation of max-flow to min-cut for generalized networks |
scientific article; zbMATH DE number 4106577 |
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
0.8338311910629272
0 references
0.812127947807312
0 references
0.8106589913368225
0 references
0.8103278279304504
0 references
