Fault-tolerant graph realizations in the congested clique (Q6112001)

From MaRDI portal
Revision as of 12:00, 2 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7722895
Language Label Description Also known as
English
Fault-tolerant graph realizations in the congested clique
scientific article; zbMATH DE number 7722895

    Statements

    title
    Fault-tolerant graph realizations in the congested clique (English)
    0 references
    publication date
    4 August 2023
    0 references
    zbMATH Keywords
    graph realizations
    0 references
    congested-clique
    0 references
    distributed algorithm
    0 references
    fault-tolerant algorithm
    0 references
    crash fault
    0 references
    time complexity
    0 references
    message complexity
    0 references
    cites work
    Skip graphs
    0 references
    Q4398822
    0 references
    Q3287781
    0 references
    Q4828919
    0 references
    Q4252758
    0 references
    Q5417681
    0 references
    Q4608063
    0 references
    Q3579423
    0 references
    Q4473321
    0 references
    Q4736826
    0 references

    Identifiers

    arXiv ID
    2208.10135
    0 references
    zbMATH DE Number
    7722895
    0 references
    OpenAlex ID
    W4312347427
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6112001&oldid=37548843"
    Powered by MediaWiki