{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:46:37Z","timestamp":1759837597376},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0304-3975(01)00239-0","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"139-149","source":"Crossref","is-referenced-by-count":16,"title":["Optimal algorithms for complete linkage clustering in d dimensions"],"prefix":"10.1016","volume":"286","author":[{"given":"Drago","family":"Krznaric","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00239-0_BIB1","doi-asserted-by":"crossref","unstructured":"P. Arabie, L.J. Hubert, G. De Soete (Eds.), Clustering and Classification, World Scientific, Singapore, 1996.","DOI":"10.1142\/1930"},{"key":"10.1016\/S0304-3975(01)00239-0_BIB2","unstructured":"F. Aurenhammer, R. Klein, Voronoi diagrams, Tech. Report 198-5, Informatik, FernUniversit\u00e4t, Hagen, Germany, 1996."},{"key":"10.1016\/S0304-3975(01)00239-0_BIB3","doi-asserted-by":"crossref","unstructured":"S.N. Bespamyatnikh, An optimal algorithm for closest pair maintenance, Proc. 11th ACM Symp. on Computational Geometry, 1995, pp. 152\u2013161.","DOI":"10.1145\/220279.220296"},{"issue":"1","key":"10.1016\/S0304-3975(01)00239-0_BIB4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890115","article-title":"Efficient algorithms for agglomerative hierarchical clustering methods","volume":"1","author":"Day","year":"1984","journal-title":"J. Classification"},{"key":"10.1016\/S0304-3975(01)00239-0_BIB5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","article-title":"An efficient algorithm for a complete link method","volume":"20","author":"Defays","year":"1977","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00239-0_BIB6","doi-asserted-by":"crossref","first-page":"623","DOI":"10.2307\/2528417","article-title":"A comparison of some methods of cluster analysis","volume":"23","author":"Gower","year":"1967","journal-title":"Biometrics"},{"key":"10.1016\/S0304-3975(01)00239-0_BIB7","doi-asserted-by":"crossref","unstructured":"D. Krznaric, C. Levcopoulos, Fast algorithms for compete linkage clustering, Discrete Comput. Geom. 19 (1998) 131\u2013145, A preliminary version of that paper appeared as: The first subquadratic algorithm for complete linkage clustering. Proc. 6th Internat. Symp. on Algorithms and Computation, Lecture notes in Computer Science, Vol. 1004, Springer, Berlin, 1995, pp. 392\u2013401.","DOI":"10.1007\/PL00009332"},{"issue":"3","key":"10.1016\/S0304-3975(01)00239-0_BIB8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0031-3203(91)90062-A","article-title":"An efficient agglomerative clustering algorithm using a heap","volume":"24","author":"Kurita","year":"1991","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0304-3975(01)00239-0_BIB9","unstructured":"M. Kr\u0306iv\u00e1nek, Connected admissible hierarchical clustering. Paper presented at the DIANA III Conf. Bechyne, Czechoslovakia, June 1990. Published in the KAM-Series as Tech. Report No. 90-189, 8 pages, School of Computer Science, Faculty of Mathematics and Physics, Charles University, Prague, 1990."},{"key":"10.1016\/S0304-3975(01)00239-0_BIB10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1038\/212218a0","article-title":"A generalised sorting strategy for computer classifications","volume":"212","author":"Lance","year":"1966","journal-title":"Nature"},{"issue":"11","key":"10.1016\/S0304-3975(01)00239-0_BIB11","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/34.61708","article-title":"Parallel algorithms for hierarchical clustering and cluster validity","volume":"12","author":"Li","year":"1990","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0304-3975(01)00239-0_BIB12","first-page":"101","article-title":"Complexities of hierarchic clustering algorithms","volume":"1","author":"Murtagh","year":"1984","journal-title":"Comput. Statist. Quart."},{"key":"10.1016\/S0304-3975(01)00239-0_BIB13","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(01)00239-0_BIB14","first-page":"1409","article-title":"A statistical method for evaluating systematic relationships","volume":"38","author":"Sokal","year":"1958","journal-title":"Univ. Kans. Sci. Bull."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T11:33:53Z","timestamp":1583494433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397501002390"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00239-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}