An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEDA / rank | |||
Normal rank | |||
Revision as of 04:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of the highest-level selection rule in the preflow-push max-flow algorithm |
scientific article |
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
