Deterministic graph connectivity in the broadcast congested clique

Pedro Montealegre, Ioan Todinca

We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and…