30

Fast algorithms for constructing minimal spanning trees in coordinate spaces
– J L BENTLEY, J H FRIEDMAN
 1978

66

Multidimensional Clustering Algorithms, Compstat lectures
– F Murtagh
 1985

2431

The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
 1974

3

Expectedtime complexity results for hierarchical clustering algorithms which use cluster centers
– F Murtagh
 1983

106

A survey of recent advances in hierarchical clustering algorithms which use cluster centers
– F MURTAGH
 1984

7

Algorithm 76: Hierarchical clustering using the minimum spanning tree
– F J Rohlf
 1973

23

Optimal expected time algorithms for closest point problems
– J Bentley, B Weide, A Yao

37

An efficient algorithm for a complete link method
– D Defays
 1977

75

Efficient algorithms for agglomerative hierarchical clustering methods
– W H E Day, H Edelsbrunner
 1984

6

Efficiency of hierarchical agglomerative clustering using the ICL distributed array processor
– E M Rasmussen, P Willett
 1989

4

A very fast exact nearest neighbor algorithm for use in information retrieval
– F Murtagh
 1982

6

The nearest neighbor problem in information retrieval: An algorithm using upperbounds
– A F Smeaton, C J van Rijsbergen
 1981

5

A probabilistic algorithm for nearest neighbour searching
– S F Weiss
 1981

9

Tree structures for high dimensionality nearest neighbor searching
– C M Eastman, S F Weiss
 1982

118

A branch and bound algorithm for computing knearest neighbors
– K Fukunaga, P Narendra
 1975

11

Shortest Connection Networks and Some
– R C Prim
 1957

21

The Relation Between Measures of Correlation in the Universe of Sample Permutations
– H E Daniels
 1944

3

TwoSample Tests for Multivariate Distributions
– L Weiss
 1960

2

Some Convergence Properties of kNearest Neighbor Estimates
– W H Rogers
 1976
