28 citations · 49 across the 7 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams
Cristian Boldrin, C. Seshadhri
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 algori…
cs.NI2026
RNG: Flat Datacenter Networks at Scale
Giacomo Bernardi, Ratul Mahajan, C. Seshadhri +8
We design and deploy in production the first flat datacenter networks. Our design, called RNG, is based on quasi-random graphs. While the cost and fault-tolerance benefits of such…
cs.DS2026
A note on approximating the average degree of bounded arboricity graphs
Talya Eden, C. Seshadhri
Estimating the average degree of graph is a classic problem in sublinear graph algorithm. Eden, Ron, and Seshadhri (ICALP 2017, SIDMA 2019) gave a simple algorithm for this problem…