• DOI:10.1145/3293611.3331605
Corpus ID: 53216277

Hardness of Minimal Symmetry Breaking in Distributed Computing

@article{Balliu2019HardnessOM,
  title={Hardness of Minimal Symmetry Breaking in Distributed Computing},
  author={Alkida Balliu and J. Hirvonen and Dennis Olivetti and J. Suomela},
  journal={Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing},
  year={2019}
}

• Alkida Balliu, J. Hirvonen, +1 author J. Suomela
• Published 2019
• Computer Science
• Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

A graph is weakly 2-colored if the nodes are labeled with colors black and white such that each black node is adjacent to at least one white node and vice versa. In this work we study the distributed computational complexity of weak 2-coloring in the standard łocal model of distributed computing, and how it is related to the distributed computational complexity of other graph problems. First, we show that weak 2-coloring is a minimal distributed symmetry-breaking problem for regular even-degree… Expand

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed