Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Matching Via Balls-and-Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886046 / rank
 
Normal rank

Latest revision as of 17:36, 10 July 2024

scientific article
Language Label Description Also known as
English
Efficient Primal-Dual Graph Algorithms for MapReduce
scientific article

    Statements

    Efficient Primal-Dual Graph Algorithms for MapReduce (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2015
    0 references
    densest subgraph problem
    0 references
    MapReduce
    0 references
    fractional maximum matching problem in bipartite graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references