Answers are grounded in this paper and cite their sources.
Clustering of data has numerous applications and has been studied extensively. Though most of the algorithms in the literature are sequential, many parallel algorithms have also been designed. In this paper, we present parallel algorithms with better performance than known algorithms. We consider algorithms that work well in the worst case as well as algorithms with good expected performance.
No takes yet. Share an insight, caveat, or question.
Sanguthevar Rajasekaran (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: