Distributed discovery of large near-cliques

Zvika Brakerski; Boaz Patt-Shamir

doi:10.1007/978-3-642-04355-0_22

Distributed discovery of large near-cliques

Zvika Brakerski^*, Boaz Patt-Shamir

^*Corresponding author for this work

School of Electrical Engineering

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

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 ε ³-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 language	English
Title of host publication	Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings
Pages	206-220
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-04355-0_22
State	Published - 2009
Event	23rd International Symposium on Distributed Computing, DISC 2009 - Elche, Spain Duration: 23 Sep 2009 → 25 Sep 2009

Publication series

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

Conference

Conference	23rd International Symposium on Distributed Computing, DISC 2009
Country/Territory	Spain
City	Elche
Period	23/09/09 → 25/09/09

Access to Document

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

Cite this

Brakerski, Z., & Patt-Shamir, B. (2009). Distributed discovery of large near-cliques. In Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings (pp. 206-220). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5805 LNCS). https://doi.org/10.1007/978-3-642-04355-0_22

@inproceedings{36f3de8cef004b34af0e41c7473c6d5d,

title = "Distributed discovery of large near-cliques",

abstract = "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.",

author = "Zvika Brakerski and Boaz Patt-Shamir",

year = "2009",

doi = "10.1007/978-3-642-04355-0_22",

language = "אנגלית",

isbn = "3642043542",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "206--220",

booktitle = "Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings",

note = "23rd International Symposium on Distributed Computing, DISC 2009 ; Conference date: 23-09-2009 Through 25-09-2009",

}

Brakerski, Z & Patt-Shamir, B 2009, Distributed discovery of large near-cliques. in Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5805 LNCS, pp. 206-220, 23rd International Symposium on Distributed Computing, DISC 2009, Elche, Spain, 23/09/09. https://doi.org/10.1007/978-3-642-04355-0_22

Distributed discovery of large near-cliques. / Brakerski, Zvika; Patt-Shamir, Boaz.
Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings. 2009. p. 206-220 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5805 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

T2 - 23rd International Symposium on Distributed Computing, DISC 2009

Y2 - 23 September 2009 through 25 September 2009

ER -

Distributed discovery of large near-cliques

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this