On the complexity of preflow-push algorithms for maximum-flow problems (Q1322568)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of preflow-push algorithms for maximum-flow problems |
scientific article |
Statements
On the complexity of preflow-push algorithms for maximum-flow problems (English)
0 references
12 January 1995
0 references
network flows
0 references
complexity
0 references
maximum flow
0 references
preflow-push algorithms
0 references
