On the Distributed Complexity of Large-Scale Graph Computations

26 February 2016

Papers citing "On the Distributed Complexity of Large-Scale Graph Computations"

7 / 7 papers shown

Title
What Can We Compute in a Single Round of the Congested Clique? Peter Robinson 25 4 0 06 Oct 2022
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 25 14 0 13 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques K. Censor-Hillel Orr Fischer Franccois Le Gall Dean Leitersdorf R. Oshman GNN 11 22 0 09 Jan 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 24 6 0 02 Oct 2021
Tight Distributed Listing of Cliques K. Censor-Hillel Yi-Jun Chang Franccois Le Gall Dean Leitersdorf 23 20 0 14 Nov 2020
Distributed Detection of Cliques in Dynamic Networks Matthias Bonne K. Censor-Hillel GNN 19 12 0 25 Apr 2019
Deterministic subgraph detection in broadcast CONGEST Janne H. Korhonen Joel Rybicki 24 51 0 29 May 2017