A second look at counting triangles in graph streams (corrected)
From MaRDI portal
Publication:2397608
Recommendations
Cites work
- Approximately counting triangles in sublinear time
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Communication Complexity
- Computing and Combinatorics
- Experimental and Efficient Algorithms
- How hard is counting triangles in the streaming model?
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
Cited in
(9)- Corrigendum to: ``A second look at counting triangles in graph streams
- scientific article; zbMATH DE number 6862103 (Why is no real title available?)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- Counting Triangles under Updates in Worst-Case Optimal Time
- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- Counting simplices in hypergraph streams
- Towards optimal dynamic indexes for approximate (and exact) triangle counting
- A second look at counting triangles in graph streams
- On triangle estimation using tripartite independent set queries
This page was built for publication: A second look at counting triangles in graph streams (corrected)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397608)