Distributed discovery of large near-cliques

Zvika Brakerski*, Boaz Patt-Shamir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Given an undirected graph and 0≤ε≤1, 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 ε 3-near clique of linear size in the graph. The algorithm uses messages of O(logn) bits. The failure probability can be reduced to in O(logn) time factor, and the algorithm also works if the graph contains a clique of size for some α (0,1). Our approach is based on a new idea of adapting property testing algorithms to the distributed setting.

Original languageEnglish
Title of host publicationDistributed Computing - 23rd International Symposium, DISC 2009, Proceedings
Number of pages15
StatePublished - 2009
Event23rd International Symposium on Distributed Computing, DISC 2009 - Elche, Spain
Duration: 23 Sep 200925 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5805 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference23rd International Symposium on Distributed Computing, DISC 2009


Dive into the research topics of 'Distributed discovery of large near-cliques'. Together they form a unique fingerprint.

Cite this