Distributed Discovery of Large Near-Cliques
Zvika Brakerski
Boaz Patt-Shamir
- GNN

Abstract
Given an undirected graph and , a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we present a fast synchronous network algorithm that uses small messages and finds a near-clique. Specifically, we present a constant-time algorithm that finds, with constant probability of success, a linear size -near clique if there exists an -near clique of linear size in the graph. The algorithm uses messages of bits. The failure probability can be reduced to in time, and the algorithm also works if the graph contains a clique of size for some .
View on arXivComments on this paper