An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm (Q3798456)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm |
scientific article |
Statements
An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm (English)
0 references
1988
0 references
polynomial algorithm
0 references
minimum-cost circulation
0 references
network
0 references
dense graphs
0 references
out-of-kilter algorithm
0 references
