Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network (Q4275336)
From MaRDI portal
scientific article; zbMATH DE number 484752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network |
scientific article; zbMATH DE number 484752 |
Statements
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network (English)
0 references
13 January 1994
0 references
minimum-cost maximum flow
0 references
series-parallel network
0 references
balanced search tree
0 references
