Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SALSA: the stochastic approach for link-structure analysis
ACM Transactions on Information Systems (TOIS)
Approximation algorithms for maximization problems arising in graph partitioning
Journal of Algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Massive Quasi-Clique Detection
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Three theorems regarding testing graph properties
Random Structures & Algorithms
On the Bursty Evolution of Blogspace
World Wide Web
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Parallel monotonicity reconstruction
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Constant-Time Approximation Algorithms via Local Improvements
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.