Lower Bounds for Induced Cycle Detection in Distributed Computing

2 October 2021

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

10 / 10 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 137 28 0 19 Jan 2021
Tight Distributed Listing of Cliques K. Censor-Hillel Yi-Jun Chang Franccois Le Gall Dean Leitersdorf 63 21 0 14 Nov 2020
On Distributed Listing of Cliques K. Censor-Hillel F. Gall Dean Leitersdorf 36 24 0 10 Jul 2020
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 48 47 0 17 Jul 2018
Detecting cliques in CONGEST networks A. Czumaj C. Konrad 48 36 0 03 Jul 2018
Distributed Detection of Cycles Pierre Fraigniaud Dennis Olivetti 36 27 0 13 Jun 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 70 55 0 16 May 2017
On the Distributed Complexity of Large-Scale Graph Computations Gopal Pandurangan Peter Robinson Michele Scquizzato 71 53 0 26 Feb 2016
Algebraic Methods in the Congested Clique K. Censor-Hillel P. Kaski Janne H. Korhonen Christoph Lenzen A. Paz Jukka Suomela 35 159 0 17 Mar 2015
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting Danny Dolev Christoph Lenzen Shir Peled 68 111 0 31 Jan 2012