Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time

DOI10.1007/3-540-60692-0_66MaRDI QIDQ2956702zbMATH OpenOpenAlexFDO

Authors Drago Krznaric, Christos Levcopoulos

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_66

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing Euclidean maximum spanning trees
• A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
• Fast algorithms for complete linkage clustering
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Efficient algorithms for agglomerative hierarchical clustering methods

Cited in

(5)

• Clustering with prim's sequential representation of minimum spanning tree
• Approximate distance oracles for graphs with dense clusters
• Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
• The first subquadratic algorithm for complete linkage clustering
• A fast heuristic for approximating the minimum weight triangulation

This page was built for publication: Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time

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