Round Compression for Parallel Matching Algorithms (Q5130844)

From MaRDI portal
Revision as of 20:59, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126835252, #quickstatements; #temporary_batch_1723663638014)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7268368
Language Label Description Also known as
English
Round Compression for Parallel Matching Algorithms
scientific article; zbMATH DE number 7268368

    Statements

    title
    Round Compression for Parallel Matching Algorithms (English)
    0 references
    author
    Jakub Łącki
    0 references
    Aleksander Mądry
    0 references
    Slobodan Mitrović
    0 references
    Krzysztof Onak
    0 references
    Piotr Sankowski
    0 references
    Artur Czumaj
    0 references
    publication date
    29 October 2020
    0 references
    zbMATH Keywords
    maximum matching
    0 references
    vertex partitioning
    0 references
    round compression
    0 references
    describes a project that uses
    MapReduce
    0 references
    Hadoop
    0 references
    Dryad
    0 references
    Spark
    0 references
    cites work
    Q5417679
    0 references

    Identifiers

    DOI
    10.1137/18M1197655
    0 references
    Mathematics Subject Classification ID
    68W10
    0 references
    05C70
    0 references
    68W25
    0 references
    68W40
    0 references
    zbMATH DE Number
    7268368
    0 references
    Wikidata QID
    Q126835252
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5130844&oldid=37590614"
    Powered by MediaWiki