3 citations · 5 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Almost Optimal Bounds for Sublinear-Time Sampling of -Cliques: Sampling Cliques is Harder Than Counting
Talya Eden, Dana Ron, Will Rosenbaum
In this work, we consider the problem of sampling a -clique in a graph from an almost uniform distribution in sublinear time in the general graph query model. Specifically the a…
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…