Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1995: Algorithms and Computations pp 392–401Cite as

The first subquadratic algorithm for complete linkage clustering

  • Session 11A
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1004))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Franz Aurenhammer. Voronoi diagrams — A survey of a fundamental geometric data structure. ACM comp. Surveys 23(3), 1991, 345–405.

    Google Scholar 

  2. A. D. Gordon. Classification. Chapman and Hall, 1981.

    Google Scholar 

  3. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, New Jersey, 1988.

    Google Scholar 

  4. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing 12(1), 1983, 28–35.

    Google Scholar 

  5. D. Krznaric and C. Levcopoulos. Fast algorithms for complete linkage clustering. Tech. Rep. LU-CS-TR:95-143, Dep. Comp. Sci., Lund Univ., 1995.

    Google Scholar 

  6. D. Krznaric and C. Levcopoulos. Computing a threaded quadtree (with links between neighbors) from the Delaunay triangulation in linear time. 7th Canadian Conf. on Computational Geometry, 1995, 187–192.

    Google Scholar 

  7. D. Krznaric and C. Levcopoulos. Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time. 15th Conf. on FST & TCS, Lecture Notes in Comp. Sci., 1995.

    Google Scholar 

  8. F. Preparata and M. Shamos. Computational geometry: an introduction. Springer-Verlag, 1985.

    Google Scholar 

  9. M. I. Shamos. Computational geometry. Ph. D. thesis, Dep. Comp. Sci., Yale Univ., 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Drago Krznaric & Christos Levcopoulos

Authors
  1. Drago Krznaric
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krznaric, D., Levcopoulos, C. (1995). The first subquadratic algorithm for complete linkage clustering. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015445

Download citation

  • DOI: https://doi.org/10.1007/BFb0015445

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation