Distributed symmetry-breaking algorithms for congested cliques

DOI10.1007/978-3-319-90530-3_5zbMath1484.68320arXiv1802.07209OpenAlexW2963606810MaRDI QIDQ1625140

Leonid Barenboim, Victor Khazanov

Publication date: 28 November 2018

Full work available at URL: https://arxiv.org/abs/1802.07209

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (3)

Fault-tolerant graph realizations in the congested clique ⋮ Unnamed Item ⋮ Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC

This page was built for publication: Distributed symmetry-breaking algorithms for congested cliques