4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen +3
In this paper we give fast distributed graph algorithms for detecting and listing small subgraphs, and for computing or approximating the girth. Our algorithms improve upon the sta…
cs.DS2017
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer, Tzlil Gonen, Rotem Oshman
In the distributed subgraph-freeness problem, we are given a graph , and asked to determine whether the network graph contains as a subgraph or not. Subgraph-freeness is an…
cs.DS2017★ 4 cited
Distributed Property Testing for Subgraph-Freeness Revisited
Orr Fischer, Tzlil Gonen, Rotem Oshman
In the subgraph-freeness problem, we are given a constant-size graph , and wish to determine whether the network contains as a subgraph or not. The \emph{property-testing} r…