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 nearclique. 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 factor, and the algorithm also works if the graph contains a clique of size Ω(n/logα log n) for some α ∈ (0, 1). Our approach is based on a new idea of adapting property testing algorithms to the distributed setting.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.