New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587)

From MaRDI portal
Revision as of 23:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
New bounds for the CLIQUE-GAP problem using graph decomposition theory
scientific article

    Statements

    New bounds for the CLIQUE-GAP problem using graph decomposition theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 April 2018
    0 references
    communication complexity
    0 references
    clique
    0 references
    streaming algorithm
    0 references
    graph decomposition
    0 references
    triangle counting
    0 references

    Identifiers