The first subquadratic algorithm for complete linkage clustering

DOI10.1007/BFB0015445MaRDI QIDQ6487987zbMATH OpenFDO

Authors Drago Krznaric, Christos Levcopoulos

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015445

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Cites work

• Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3800808 (Why is no real title available?)
• Optimal Search in Planar Subdivisions

This page was built for publication: The first subquadratic algorithm for complete linkage clustering

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