Lower Bounds for Induced Cycle Detection in Distributed Computing

2 October 2021

Papers citing "Lower Bounds for Induced Cycle Detection in Distributed Computing"

6 / 6 papers shown

Title
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 130 27 0 19 Jan 2021
Tight Distributed Listing of Cliques K. Censor-Hillel Yi-Jun Chang Franccois Le Gall Dean Leitersdorf 53 20 0 14 Nov 2020
On Distributed Listing of Cliques K. Censor-Hillel F. Gall Dean Leitersdorf 26 23 0 10 Jul 2020
Detecting cliques in CONGEST networks A. Czumaj C. Konrad 38 35 0 03 Jul 2018
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 28 159 0 17 Mar 2015
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting Danny Dolev Christoph Lenzen Shir Peled 58 111 0 31 Jan 2012