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

18 July 2019

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

4 / 4 papers shown

Title
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 59 1 0 12 Nov 2023
Mending Partial Solutions with Few Changes Darya Melnyk Jukka Suomela Neven Villani 25 2 0 12 Sep 2022
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 30 18 0 09 Feb 2022
The randomized local computation complexity of the Lovász local lemma S. Brandt Christoph Grunau Václav Rozhon 23 10 0 30 Mar 2021