Computing Maximal “Polymatroidal” Network Flows (Q3964296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3786472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Maximal “Polymatroidal” Network Flows |
scientific article; zbMATH DE number 3786472 |
Statements
Computing Maximal “Polymatroidal” Network Flows (English)
0 references
1982
0 references
constrained flows
0 references
polymatroidal network flow
0 references
capacities of sets of arcs
0 references
augmenting path theorem
0 references
integral flow theorem
0 references
max-flow min-cut theorem
0 references
maximal flow algorithm
0 references
