Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (Q1838036): Difference between revisions

@@ Property / author @@
+Fionn Murtagh
@@ Property / author: Fionn Murtagh / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(83)90095-9
+Normal rank
@@ Property / OpenAlex ID @@
+W1969242249
@@ Property / OpenAlex ID: W1969242249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3042217
@@ Property / cites work: Q3042217 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic minimum spanning tree algorithm
@@ Property / cites work: A probabilistic minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
+Normal rank
@@ Property / cites work @@
+Optimal Expected-Time Algorithms for Closest Point Problems
+Normal rank
@@ Property / cites work @@
+Q3954671
@@ Property / cites work: Q3954671 / rank @@
+Normal rank
@@ Property / cites work @@
+Reflexive Nearest Neighbours
@@ Property / cites work: Reflexive Nearest Neighbours / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670385
@@ Property / cites work: Q3670385 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3954672
@@ Property / cites work: Q3954672 / rank @@
+Normal rank