5 citations · 16 across the 11 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2023
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…
cs.DC2018
Property Testing of Planarity in the CONGEST model
Reut Levi, Moti Medina, Dana Ron
We give a distributed algorithm in the {\sf CONGEST} model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et a…
cs.DC2017
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model
Guy Even, Reut Levi, Moti Medina
In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the g…