A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3489766)
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 4162618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM |
scientific article; zbMATH DE number 4162618 |
Statements
A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM (English)
0 references
1990
0 references
static flow
0 references
maximum balanced flow problem
0 references
two terminal network
0 references
binary search
0 references
Dinic's maximum flow algorithm
0 references
0.8808572292327881
0 references
0.869248628616333
0 references
0.8538604378700256
0 references
0.8467318415641785
0 references
0.845212459564209
0 references
