25 citations · 49 across the 16 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
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…