A second look at counting triangles in graph streams (Q740973): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How Hard Is Counting Triangles in the Streaming Model? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful triangle counting and a \textsc{MapReduce} implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank

Latest revision as of 01:25, 9 July 2024

scientific article
Language Label Description Also known as
English
A second look at counting triangles in graph streams
scientific article

    Statements

    A second look at counting triangles in graph streams (English)
    0 references
    0 references
    0 references
    10 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    data streams
    0 references
    randomized algorithms
    0 references
    graphs
    0 references
    0 references
    0 references