The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655)
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: The MA-ordering max-flow algorithm is not strongly polynomial for directed networks |
scientific article; zbMATH DE number 2077342
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The MA-ordering max-flow algorithm is not strongly polynomial for directed networks |
scientific article; zbMATH DE number 2077342 |
Statements
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (English)
0 references
1 July 2004
0 references
Maximum flow
0 references
MA ordering
0 references
Weakly polynomial
0 references
Strongly polynomial
0 references
0 references
