Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274)

From MaRDI portal
Revision as of 09:06, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Efficient Primal-Dual Graph Algorithms for MapReduce
scientific article

    Statements

    title
    Efficient Primal-Dual Graph Algorithms for MapReduce (English)
    0 references
    author
    Bahman Bahmani
    0 references
    Ashish Goel
    0 references
    Kamesh Munagala
    0 references
    publication date
    9 September 2015
    0 references
    zbMATH Keywords
    densest subgraph problem
    0 references
    MapReduce
    0 references
    fractional maximum matching problem in bipartite graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C82
    0 references
    05C60
    0 references
    05C42
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6480008
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2945274&oldid=27372889"
    Powered by MediaWiki