A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Efficient parallel hierarchical clustering algorithms
2005
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
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.
doi:10.1109/tpds.2005.72
fatcat:epykotvodfgohbmy6yyown64sa