Graph reconstruction in the congested clique (Q2186818)

From MaRDI portal
Revision as of 22:08, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph reconstruction in the congested clique
scientific article

    Statements

    title
    Graph reconstruction in the congested clique (English)
    0 references
    author
    Pedro Montealegre
    0 references
    Ivan Rapaport
    0 references
    Ioan Todinca
    0 references
    publication date
    9 June 2020
    0 references
    zbMATH Keywords
    distributed computing
    0 references
    congested clique
    0 references
    round complexity
    0 references
    reconstruction problem
    0 references
    graph classes
    0 references
    describes a project that uses
    MapReduce
    0 references
    Hadoop
    0 references
    Dryad
    0 references
    Pregel
    0 references
    Spark
    0 references
    cites work
    Q4608063
    0 references
    Q5417679
    0 references
    Q4301239
    0 references
    Q3683903
    0 references
    Brief Announcement
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C69
    0 references
    68W15
    0 references
    68W40
    0 references
    zbMATH DE Number
    7210421
    0 references
    OpenAlex ID
    W3021194740
    0 references
    arXiv ID
    1706.03107
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2186818&oldid=36592633"
    Powered by MediaWiki