Log In Sign Up

Local Mending

by   Alkida Balliu, et al.

In this work we introduce the graph-theoretic notion of mendability: for each locally checkable graph problem we can define its mending radius, which captures the idea of how far one needs to modify a partial solution in order to "patch a hole." We explore how mendability is connected to the existence of efficient algorithms, especially in distributed, parallel, and fault-tolerant settings. It is easy to see that O(1)-mendable problems are also solvable in O(log^* n) rounds in the LOCAL model of distributed computing. One of the surprises is that in paths and cycles, a converse also holds in the following sense: if a problem Π can be solved in O(log^* n), there is always a restriction Π' ⊆Π that is still efficiently solvable but that is also O(1)-mendable. We also explore the structure of the landscape of mendability. For example, we show that in trees, the mending radius of any locally checkable problem is O(1), Θ(log n), or Θ(n), while in general graphs the structure is much more diverse.


page 1

page 2

page 3

page 4


Efficient Classification of Local Problems in Regular Trees

We give practical, efficient algorithms that automatically determine the...

Mending Partial Solutions with Few Changes

In this paper, we study the notion of mending, i.e. given a partial solu...

Locally Checkable Labelings with Small Messages

A rich line of work has been addressing the computational complexity of ...

Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees

In this work, we develop the low-space Massively Parallel Computation (M...

Overcoming Congestion in Distributed Coloring

We present a new technique to efficiently sample and communicate a large...

Optimal Deterministic Massively Parallel Connectivity on Forests

We show fast deterministic algorithms for fundamental problems on forest...

Distributed Computing in the Asynchronous LOCAL model

The LOCAL model is among the main models for studying locality in the fr...