Distributed algorithms for graph optimisation seek to solve combinatorial problems—such as covering, colouring, matching and domination—through local computation and limited communication. Each node ...