A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new Karzanov-type \(O(n^ 3)\) max-flow algorithm |
scientific article |
Statements
A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (English)
0 references
16 January 1993
0 references
maximum value flows
0 references
directed single commodity networks
0 references
maximal flow
0 references
phase algorithms
0 references
layered networks
0 references
