Efficient parallel hierarchical clustering algorithms

  • Rajasekaran S
  • 22

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • PRAMs
  • Reconfigurable networks
  • hierarchical clustering
  • mesh-connected computers
  • meshes with optical buses
  • single-link metric.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • S. Rajasekaran

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free