An \(O(EV\log^2V)\) algorithm for the maximal flow problem (Q1147636): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5624995 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5514188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum Flow in Planar Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4058442 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank | |||
Latest revision as of 10:06, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(EV\log^2V)\) algorithm for the maximal flow problem |
scientific article |
Statements
An \(O(EV\log^2V)\) algorithm for the maximal flow problem (English)
0 references
1980
0 references
maximal flow problem
0 references
path compression
0 references
union find algorithm
0 references
flows in networks
0 references
comparison of algorithms
0 references
numerical analysis
0 references
implementation
0 references
asymptotic behavior
0 references
