A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310)
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: A strongly polynomial contraction-expansion algorithm for network flow problems |
scientific article; zbMATH DE number 6901427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial contraction-expansion algorithm for network flow problems |
scientific article; zbMATH DE number 6901427 |
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
0.9234282
0 references
0.92308366
0 references
0.90998816
0 references
0 references
0 references
0.9047338
0 references
0.9012769
0 references
0.8994754
0 references
0.89749646
0 references
