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}
}
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
15 Citations
Classification of distributed binary labeling problems
  • 14
  • PDF
Lower Bounds for Maximal Matchings and Maximal Independent Sets
  • 30
  • PDF
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
  • 4
Truly Tight-in-$\Delta$ Bounds for Bipartite Maximal Matching and Variants
  • PDF
An Automatic Speedup Theorem for Distributed Problems
  • 19
  • PDF
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
  • 3
  • PDF
Distributed Computing Column 76: Annual Review 2019
...
1
2
...

References

SHOWING 1-4 OF 4 REFERENCES
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
  • 821
  • Highly Influential
  • PDF
A Time Hierarchy Theorem for the LOCAL Model
  • Yi-Jun Chang, Seth Pettie
  • Computer Science, Mathematics
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
  • 38
  • Highly Influential
  • PDF
What Can Be Computed Locally ?
  • 194
  • Highly Influential
  • PDF
Hardness of minimal symmetry breaking in distributed computing
  • 2018