An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem (Q1151034): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theoretical efficiency of various network flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank
 
Normal rank

Latest revision as of 10:51, 13 June 2024

scientific article
Language Label Description Also known as
English
An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
scientific article

    Statements

    An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem (English)
    0 references
    0 references
    1980
    0 references

    Identifiers