A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0895-7177(92)90007-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994891541 / rank | |||
Normal rank | |||
Revision as of 01:10, 20 March 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
