An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analysis of the highest-level selection rule in the preflow-push max-flow algorithm |
scientific article; zbMATH DE number 6594042
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm |
scientific article; zbMATH DE number 6594042 |
Statements
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (English)
0 references
16 June 2016
0 references
computational complexity
0 references
potential function arguments
0 references
max-flow problem
0 references
reflow-push method
0 references
0.91614956
0 references
0.8861425
0 references
0.8618202
0 references
0.8532837
0 references
0.85286975
0 references
0 references
