4 papers · 1 filter
Classification of Local Optimization Problems in Directed Cycles
Thomas Boudier, Fabian Kuhn, Augusto Modanese +2
We present a complete classification of the distributed computational complexity of local optimization problems in directed cycles for both the deterministic and the randomized LOC…
Distributed Algorithms for Potential Problems
Alkida Balliu, Thomas Boudier, Francesco d'Amore +4
In this work, we present a fast distributed algorithm for local potential problems: these are graph problems where the task is to find a locally optimal solution where no node can…
Orientation does not help with 3-coloring a grid in online-LOCAL
Thomas Boudier, Filippo Casagrande, Avinandan Das +4
The online-LOCAL and SLOCAL models are extensions of the LOCAL model where nodes are processed in a sequential but potentially adversarial order. So far, the only problem we know o…
Tight Lower Bounds in the Supported LOCAL Model
Alkida Balliu, Thomas Boudier, Sebastian Brandt +1
We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start…