Distributed Discovery of Large Near-Cliques
| dc.creator | Brakerski, Zvika | |
| dc.creator | Patt-Shamir, Boaz | |
| dc.date | 2009-05-26 | |
| dc.date.accessioned | 2026-07-07T13:18:11Z | |
| dc.date.available | 2026-07-07T13:18:11Z | |
| dc.description | Given an undirected graph and $0\leε\le1$, 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(\log n)$ bits. The failure probability can be reduced to $n^{-Ω(1)}$ in $O(\log n)$ time, and the algorithm also works if the graph contains a clique of size $Ω(n/\log^α\log n)$ for some $α\in (0,1)$. | |
| dc.identifier | https://arxiv.org/abs/0905.4147 | |
| dc.identifier | http://arxiv.org/abs/0905.4147 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231353 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | C.2.4; F.2.2; G.2.2 | |
| dc.title | Distributed Discovery of Large Near-Cliques | |
| dc.type | text |