Discrete & Computational Geometry

, Volume 19, Issue 1, pp 131–145 | Cite as

Fast Algorithms for Complete Linkage Clustering

  • D. Krznaric
  • C. Levcopoulos

Abstract.

It is shown that the complete linkage clustering of n points can be computed in O(n log2 n) time. Furthermore, it is shown that the complete linkage clustering can be approximated within an arbitrarily small constant factor in O(n log n) time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© 1998 Springer-Verlag New York Inc.

Authors and Affiliations

  • D. Krznaric
    • 1
  • C. Levcopoulos
    • 1
  1. 1.Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden drago@dna.lth.se christos@dna.lth.seSE

Personalised recommendations