1. Fast algorithms for constructing minimal spanning trees in coordinate spaces;Bentley;Stanford Univ. Computer Sci. Report No. STAN-CS-75-482,1975
2. Divide-and-conquer in multidimensional space;Bentley;Proc. Eighth ann. ACM symposium on the theory of computing,1976
3. Programming, games and transportation networks;Berge,1962
4. A note on two problems in connection with graphs;Dijkstra;Numer. Math.,1959
5. Clustering algorithms;Hartigan,1975