25 citations · 49 across the 16 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.SI2017
Provable and practical approximations for the degree distribution using sublinear graph samples
Talya Eden, Shweta Jain, Ali Pinar +2
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estima…
cs.DS2017
Testing bounded arboricity
Talya Eden, Reut Levi, Dana Ron
In this paper we consider the problem of testing whether a graph has bounded arboricity. The family of graphs with bounded arboricity includes, among others, bounded-degree graphs,…
cs.DS2017★ 4 cited
On Approximating the Number of -cliques in Sublinear Time
Talya Eden, Dana Ron, C. Seshadhri
We study the problem of approximating the number of -cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) deg…