An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56018633, #quickstatements; #temporary_batch_1706366595684 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:11, 30 January 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