Analysis of Preflow Push Algorithms for Maximum Network Flow (Q3034814)
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 4133489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of Preflow Push Algorithms for Maximum Network Flow |
scientific article; zbMATH DE number 4133489 |
Statements
Analysis of Preflow Push Algorithms for Maximum Network Flow (English)
0 references
1989
0 references
distributed maximum flow algorithm
0 references
heuristics
0 references
preflow push algorithms
0 references
maximum flow problem
0 references
parametrized worst-case network
0 references
0.8868146538734436
0 references
0.8796979188919067
0 references
0.8748605251312256
0 references
0.8566014766693115
0 references
