39 citations · 154 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 17 cited
ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages
Matteo Riondato, Eli Upfal
We present ABRA, a suite of algorithms that compute and maintain probabilistically-guaranteed, high-quality, approximations of the betweenness centrality of all nodes (or edges) on…
cs.DS2016★ 21 cited
TRIÈST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size
Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato +1
We present TRIÈST, a suite of one-pass streaming algorithms to compute unbiased, low-variance, high-quality approximations of the global and local (i.e., incident to each vertex) n…