Distributed Discovery of Large Near-Cliques

Details Distributed Discovery of Large Near-Cliques Distributed Discovery of Large Near-Cliques

2009-05-26

arxiv.org/abs/0905.4147v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Given an undirected graph and $0\le\epsilon\le1$, a set of nodes is called $\epsilon$-near clique if all but an $\epsilon$ 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 $\epsilon$-near clique if there exists an $\epsilon^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^{-\Omega(1)}$ in $O(\log n)$ time, and the algorithm also works if the graph contains a clique of size $\Omega(n/\log^{\alpha}\log n)$ for some $\alpha \in (0,1)$.

Affiliated with

Also associated with

No associations

Rating

Distributed Discovery of Large Near-Cliques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Discovery of Large Near-Cliques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Discovery of Large Near-Cliques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646661