Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871)

From MaRDI portal
Revision as of 12:23, 4 December 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
Sublinear-time distributed algorithms for detecting small cliques and even cycles
scientific article

    Statements

    Sublinear-time distributed algorithms for detecting small cliques and even cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2022
    0 references
    distributed computing
    0 references
    subgraph freeness
    0 references
    expander decomposition
    0 references
    CONGEST
    0 references
    0 references
    0 references
    0 references

    Identifiers

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