Hardness of Minimal Symmetry Breaking in Distributed Computing

DOI10.1145/3293611.3331605OpenAlexW2962773915MaRDI QIDQ5145237

Juho Hirvonen, Dennis Olivetti, Jukka Suomela, Alkida Balliu

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmslocal modeldistributed complexity theorylocally checkable labelings

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Locally checkable problems in rooted trees ⋮ Distributed Lower Bounds for Ruling Sets

This page was built for publication: Hardness of Minimal Symmetry Breaking in Distributed Computing