5 citations · 16 across the 11 of their papers we have counts for
22 papers
Tolerant Testers for Subgraph-Freeness
Reut Levi, Jonathan Meiri
In this paper we study the problem of tolerantly testing the property of being -free (which also implies distance approximation from being -free). In the general-graphs model…
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
Talya Eden, Reut Levi, Dana Ron +1
Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In t…
Testing -freeness in bounded-arboricity graphs
Talya Eden, Reut Levi, Dana Ron
We study the problem of testing -freeness (-cycle-freeness) for fixed constant in graphs with bounded arboricity (but unbounded degrees). In particular, we are inte…
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations
Noy Biton, Reut Levi, Moti Medina
We study the problem of finding a Hamiltonian cycle under the promise that the input graph has a minimum degree of at least , where denotes the number of vertices in the g…
Testing Triangle Freeness in the General Model in Graphs with Arboricity
Reut Levi
We study the problem of testing triangle freeness in the general graph model. This problem was first studied in the general graph model by Alon et al. (SIAM J. Discret. Math. 2008)…
Improved Local Computation Algorithms for Constructing Spanners
Rubi Arviv, Lily Chung, Reut Levi +1
A spanner of a graph is a subgraph that preserves lengths of shortest paths up to a multiplicative distortion. For every , a spanner with size and stretch $(2k+1)…