An \(O(IVI^3)\) algorithm for finding maximum flows in networks (Q1251587)
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: An \(O(IVI^3)\) algorithm for finding maximum flows in networks |
scientific article; zbMATH DE number 3607784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(IVI^3)\) algorithm for finding maximum flows in networks |
scientific article; zbMATH DE number 3607784 |
Statements
An \(O(IVI^3)\) algorithm for finding maximum flows in networks (English)
0 references
1978
0 references
Algorithm
0 references
Maximum Flows in Networks
0 references
Blocking Flows
0 references
