HomeResearchPublications

The Locality of Distributed Symmetry Breaking

back to overview

Reference

Barenboim, L., Elkin, M., Pettie, S., & Schneider, J. (2016). The Locality of Distributed Symmetry Breaking. Journal of the ACM, 63(3). (ABDC_2016: C; ABDC_2019: C; ISI_2016: 1.855; ISI_2016_5year: 4.509; ISI_2018: 2.17; VHB_3: B)

Publication type

Article in Scientific Journal

Abstract

Symmetry-breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this article we work in the LOCAL model (where the input graph and underlying distributed network are identical) and study the randomized complexity of four fundamental symmetry-breaking problems on graphs: computing MISs (maximal independent sets), maximal matchings, vertex colorings, and ruling sets.

Persons

Organizational Units

  • Institute of Information Systems
  • Hilti Chair of Business Process Management

Open Repository URL

Link

DOI

http://dx.doi.org/https://doi.org/10.1145/2903137