C. Seshadhri

Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams

Triangle counting is one of the most fundamental problems in network analysis. Given the massive sizes of real-world graphs, there is a long history of small-space streaming algorithms providing accurate estimates for this problem. However, most of the results focus on estimating the total triangle count or the number...