55 citations · 116 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 1 cited
How to Count Triangles, without Seeing the Whole Graph
Suman K. Bera, C. Seshadhri
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these…
cs.DS2020
How the Degeneracy Helps for Triangle Counting in Graph Streams
Suman K. Bera, C. Seshadhri
We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of edges, our aim is to compute a -a…