Streaming and Communication Complexity of Clique Approximation (Q2843271)

From MaRDI portal
Revision as of 23:24, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Streaming and Communication Complexity of Clique Approximation
scientific article

    Statements

    title
    Streaming and Communication Complexity of Clique Approximation (English)
    0 references
    author
    Xiaoming Sun
    0 references
    Mario Szegedy
    0 references
    Chengu Wang
    0 references
    publication date
    12 August 2013
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C69
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68W20
    0 references
    zbMATH DE Number
    6197694
    0 references
    zbMATH Keywords
    streaming
    0 references
    communication complexity
    0 references
    clique approximation
    0 references
    independent set
    0 references
    OpenAlex ID
    W101298592
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2843271&oldid=32169651"
    Powered by MediaWiki