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

v1v2 (latest)

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

18 July 2019

ArXiv (abs)PDF HTML

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

5 / 5 papers shown

Title
Mending Partial Solutions with Few Changes Darya Melnyk Jukka Suomela Neven Villani 46 2 0 12 Sep 2022
Can We Break Symmetry with o(m) Communication? Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson LRM 70 9 0 19 May 2021
The randomized local computation complexity of the Lovász local lemma S. Brandt Christoph Grunau Václav Rozhon 59 10 0 30 Mar 2021
Local Mending Alkida Balliu J. Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela LRM 85 9 0 17 Feb 2021
Classification of distributed binary labeling problems Alkida Balliu S. Brandt Yuval Efron J. Hirvonen Yannic Maus Dennis Olivetti Jukka Suomela 56 44 0 29 Nov 2019