25 citations · 49 across the 16 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 25 cited
Approximately Counting Triangles in Sublinear Time
Talya Eden, Amit Levi, Dana Ron +1
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read th…
math.CO2015
Constructing Near Spanning Trees with Few Local Inspections
Reut Levi, Guy Moshkovitz, Dana Ron +2
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following var…