TY - GEN

T1 - Distributed discovery of large near-cliques

AU - Brakerski, Zvika

AU - Patt-Shamir, Boaz

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=76649102701&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04355-0_22

DO - 10.1007/978-3-642-04355-0_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:76649102701

SN - 3642043542

SN - 9783642043543

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 206

EP - 220

BT - Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings

Y2 - 23 September 2009 through 25 September 2009

ER -