A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial contraction-expansion algorithm for network flow problems |
scientific article |
Statements
A strongly polynomial contraction-expansion algorithm for network flow problems (English)
0 references
11 July 2018
0 references
network flow problem
0 references
residual network
0 references
contracted network
0 references
minimum mean cost cycle
0 references
complexity analysis
0 references
strongly polynomial algorithm
0 references
0 references
