{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:19:17Z","timestamp":1754482757118},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606925"},{"type":"electronic","value":"9783540492634"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60692-0_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:53:31Z","timestamp":1330289611000},"page":"443-455","source":"Crossref","is-referenced-by-count":5,"title":["Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time"],"prefix":"10.1007","author":[{"given":"Drago","family":"Krznaric","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer. Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345\u2013405, 1991.","journal-title":"ACM Computing Surveys"},{"unstructured":"A. D. Gordon. Classification. Chapman and Hall, 1981.","key":"31_CR2"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J. C. Gover","year":"1969","unstructured":"J. C. Gover and G. J. S. Ross. Minimum spanning trees and single linkage-linkage cluster analysis. Applied Statistics, 18:54\u201364, 1969.","journal-title":"Applied Statistics"},{"key":"31_CR4","volume-title":"Clustering algorithms","author":"J. A. Hartigan","year":"1975","unstructured":"J. A. Hartigan. Clustering algorithms. Wiley, New York, 1975."},{"key":"31_CR5","volume-title":"Algorithms for clustering data","author":"A. K. Jain","year":"1988","unstructured":"A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, New Jersey, 1988."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(83)90023-3","volume":"28","author":"D. Kirkpatrick","year":"1984","unstructured":"D. Kirkpatrick and S. Reisch. Upper bounds for sorting integers on random access machines. Theoretical Computer Science, 28:263\u2013276, 1984.","journal-title":"Theoretical Computer Science"},{"unstructured":"D. Krznaric and C. Levcopoulos. Computing a threaded quadtree (with links between neighbors) from the delaunay triangulation in linear time. In 7th Canadian Conference on Computational Geometry, pages 187\u2013192, 1995.","key":"31_CR7"},{"doi-asserted-by":"crossref","unstructured":"D. Krznaric and C. Levcopoulos. The first subquadratic algorithm for complete linkage clustering. In 6th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science. Springer-Verlag, 1995. To appear.","key":"31_CR8","DOI":"10.1007\/BFb0015445"},{"key":"31_CR9","volume-title":"Technical Report LU-CS-TR:94-136","author":"C. Levcopoulos","year":"1994","unstructured":"C. Levcopoulos and D. Krznaric. The greedy triangulation can be computed from the delaunay in linear time. Technical Report LU-CS-TR:94-136, Department of Computer Science, Lund University, Lund, Sweden, 1994."},{"key":"31_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational geometry: an introduction. Springer-Verlag, New York, 1985."},{"issue":"2","key":"31_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02570700","volume":"14","author":"G. Robins","year":"1995","unstructured":"G. Robins and J. S. Salowe. Low-degree minimum spanning trees. Discrete & Computational Geometry, 14(2):151\u2013165, 1995.","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"31_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan. Efficiency of a good but not linear disjoint set union algorithm. Journal of the ACM, 22(2):215\u2013225, 1975.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60692-0_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:02Z","timestamp":1619573222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60692-0_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606925","9783540492634"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60692-0_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}