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

From MaRDI portal
Revision as of 06:21, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
New bounds for the CLIQUE-GAP problem using graph decomposition theory
scientific article

    Statements

    title
    New bounds for the CLIQUE-GAP problem using graph decomposition theory (English)
    0 references
    author
    Vladimir Braverman
    0 references
    Zaoxing Liu
    0 references
    Tejasvam Singh
    0 references
    N. V. Vinodchandran
    0 references
    Lin F. Yang
    0 references
    published in
    Algorithmica
    0 references
    publication date
    6 April 2018
    0 references
    zbMATH Keywords
    communication complexity
    0 references
    clique
    0 references
    streaming algorithm
    0 references
    graph decomposition
    0 references
    triangle counting
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C69
    0 references
    05C70
    0 references
    zbMATH DE Number
    6856554
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1709587&oldid=14035201"
    Powered by MediaWiki