Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique

Abstract

In this paper we present two graph algorithms in the Broadcast Congested Clique model. In this model, there are n players, which communicate in synchronous rounds. Each player represents a single node of the input graph; initially each player knows the set of edges incident to his node. In each round of communication each node can broadcast a single b–bit message to all other nodes; usually \(b \in {\mathcal {O}}(\log n)\). The goal is to compute some function of the input graph.