Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
2020
Given a stream of edge additions and deletions, how can we estimate the count of triangles in it? If we can store only a subset of the edges, how can we obtain unbiased estimates with small varianc...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
68
References
7
Citations
NaN
KQI