3 citations · 5 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2020
On Efficient Distance Approximation for Graph Properties
Nimrod Fiat, Dana Ron
A distance-approximation algorithm for a graph property in the adjacency-matrix model is given an approximation parameter and query access to the adjacen…
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…