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…