1 citations · 1 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
A characterization of one-sided error testable graph properties in bounded degeneracy graphs
Oded Lachish, Amit Levi, Ilan Newman +1
We consider graph property testing in -degenerate graphs under the random neighbor oracle model (Czumaj and Sohler, FOCS 2019). In this framework, a tester explores a graph by s…
cs.DS2026
Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
Tomer Adar, Amit Levi
A central theme in sublinear graph algorithms is the relationship between counting and sampling: can the ability to approximately count a combinatorial structure be leveraged to sa…
cs.DS2026
When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
Tomer Adar, Yahel Hotam, Amit Levi
We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries…