We prove several new tight or near-tight distributed lower bounds for classic symmetry
breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any …

The distributed coloring problem is at the core of the area of distributed graph algorithms
and it is a problem that has seen tremendous progress over the last few years. Much of the …

We give a randomized Δ-coloring algorithm in the LOCAL model that runs in poly log log n
rounds, where n is the number of nodes of the input graph and Δ is its maximum degree …

Given a dynamic graph subject to edge insertions and deletions, we show how to update an
implicit representation of a proper vertex colouring, such that colours of vertices are …

We present ${\rm poly\log\log n} $-round randomized distributed algorithms to compute
vertex splittings, a partition of the vertices of a graph into $ k $ parts such that a node of …

Linial's famous color reduction algorithm reduces a given m-coloring of a graph with
maximum degree Δ to an O (Δ 2 log m)-coloring, in a single round in the LOCAL model. We …

We obtain improved distributed algorithms in the CONGEST message-passing setting for
problems on power graphs of an input graph $ G $. This includes Coloring, Maximal …

Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial
optimization problems (COPs), exhibiting state-of-the-art performance in both graph …

We study the SUPPORTED model of distributed computing introduced by Schmid and
Suomela [Schmid and Suomela, 2013], which generalizes the LOCAL and CONGEST …

The distributed coloring problem is at the core of the area of distributed graph algorithms
and it is a problem that has recently seen remarkable progress. Much of the progress on …