Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems

DOI10.1145/3382734.3405721OpenAlexW3046714641MaRDI QIDQ5855211

Jukka Suomela, Will Rosenbaum

Publication date: 15 March 2021

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

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

zbMATH Keywords

hierarchyquery complexityLOCAL modelLCLlocally checkable labelingvolume complexity

Mathematics Subject Classification ID

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

Related Items (2)

Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ Introduction to local certification

This page was built for publication: Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems