A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 90975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new Karzanov-type \(O(n^ 3)\) max-flow algorithm |
scientific article; zbMATH DE number 90975 |
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
0 references
0.8720036149024963
0 references
0.8629822134971619
0 references
0.8621674180030823
0 references
0.861190915107727
0 references
