Distributed Symmetry-Breaking Algorithms for Congested Cliques

20 February 2018

Papers citing "Distributed Symmetry-Breaking Algorithms for Congested Cliques"

5 / 5 papers shown

Title
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs Manuela Fischer Jeff Giliberti Christoph Grunau 61 5 0 26 Jan 2023
Fault-Tolerant Graph Realizations in the Congested Clique A. R. Molla Manish Kumar S. Sivasubramaniam 21 1 0 22 Aug 2022
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 82 5 0 14 Sep 2021
Simple, Deterministic, Constant-Round Coloring in the Congested Clique A. Czumaj Peter Davies M. Parter 136 23 0 13 Sep 2020
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 48 10 0 06 Nov 2019