scientific article; zbMATH DE number 907945

zbMATH Open0852.62057MaRDI QIDQ4886790FDOQ4886790

Authors: Philippe Lehert, Ch. Dumortier 

Publication date: 12 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• Fast algorithms for complete linkage clustering
• Publication:4721426
• Discovery Science
• Optimal algorithms for complete linkage clustering in \(d\) dimensions

zbMATH Keywords

minimum spanning treeconnected componentshashingsingle linkagesquare latticeasymptotic complexity\(p\)-spaceshypercubic latticescritical percolation theory

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99) Complexity and performance of numerical algorithms (65Y20) Clustering in the social and behavioral sciences (91C20)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886790)