{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:55:27Z","timestamp":1771505727787,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,5,1]],"date-time":"1981-05-01T00:00:00Z","timestamp":357523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Social Sciences"],"published-print":{"date-parts":[[1981,5]]},"DOI":"10.1016\/0165-4896(81)90042-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:19:18Z","timestamp":1027642758000},"page":"269-287","source":"Crossref","is-referenced-by-count":105,"title":["The complexity of computing metric distances between partitions"],"prefix":"10.1016","volume":"1","author":[{"given":"William H.E.","family":"Day","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-4896(81)90042-1_BIB1","series-title":"The Design and Analysis of Computer Algorithm","author":"Aho","year":"1974"},{"key":"10.1016\/0165-4896(81)90042-1_BIB2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-2496(73)90012-6","article-title":"Multidimensional scaling of measures of distance between partitions","volume":"10","author":"Arabie","year":"1973","journal-title":"J. Math. Psych."},{"key":"10.1016\/0165-4896(81)90042-1_BIB3","first-page":"225","article-title":"Structural measures and the method of sorting","volume":"Volume I","author":"Boorman","year":"1972"},{"key":"10.1016\/0165-4896(81)90042-1_BIB4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0022-2496(73)90003-5","article-title":"Metrics on spaces of finite trees","volume":"10","author":"Boorman","year":"1973","journal-title":"J. Math. Psych."},{"key":"10.1016\/0165-4896(81)90042-1_BIB5","first-page":"213","article-title":"Information distance for discrete structures","volume":"Volume I","author":"Boyd","year":"1972"},{"key":"10.1016\/0165-4896(81)90042-1_BIB6","first-page":"74","article-title":"A comparison and evaluation of graph theoretical clustering techniques","volume":"16","author":"Corneil","year":"1978","journal-title":"INFOR \u2013 Canad. J. Oper. Res. Inform. Process"},{"key":"10.1016\/0165-4896(81)90042-1_BIB7","series-title":"Tech. Rep. CS 7819","article-title":"Optimal algorithms for basic computations in partition lattices","author":"Day","year":"1978"},{"key":"10.1016\/0165-4896(81)90042-1_BIB8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0025-5564(77)90053-0","article-title":"Validity of clusters formed by graph-theoretic cluster methods","volume":"36","author":"Day","year":"1977","journal-title":"Math. Biosci."},{"key":"10.1016\/0165-4896(81)90042-1_BIB9","series-title":"Applications of Graph Theory to Group Structure","author":"Flament","year":"1963"},{"key":"10.1016\/0165-4896(81)90042-1_BIB10","series-title":"The Structure of Appearance","author":"Goodman","year":"1951"},{"key":"10.1016\/0165-4896(81)90042-1_BIB11","series-title":"The Structure of Appearance","author":"Goodman","year":"1966"},{"key":"10.1016\/0165-4896(81)90042-1_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5 2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0165-4896(81)90042-1_BIB13","series-title":"Mathematical Taxonomy","author":"Jardine","year":"1971"},{"key":"10.1016\/0165-4896(81)90042-1_BIB14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0165-4896(81)90042-1_BIB15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/nav.3800030404","article-title":"Variants of the Hungarian method for assignment problems","volume":"3","author":"Kuhn","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0165-4896(81)90042-1_BIB16","series-title":"Combinatorial Optimization: Networks and Matroids","first-page":"182","article-title":"Bipartite matching","author":"Lawler","year":"1976"},{"key":"10.1016\/0165-4896(81)90042-1_BIB17","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1215\/S0012-7094-42-00942-6","article-title":"Theory of equivalence relations","volume":"9","author":"Ore","year":"1942","journal-title":"Duke Math. J."},{"key":"10.1016\/0165-4896(81)90042-1_BIB18","doi-asserted-by":"crossref","first-page":"846","DOI":"10.2307\/2284239","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0165-4896(81)90042-1_BIB19","first-page":"93","article-title":"An experimental study of semantic structures","volume":"Volume II","author":"Rapoport","year":"1972"},{"key":"10.1016\/0165-4896(81)90042-1_BIB20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02289843","article-title":"A metric and an ordering on sets","volume":"24","author":"Restle","year":"1959","journal-title":"Psychometrika"},{"key":"10.1016\/0165-4896(81)90042-1_BIB21","series-title":"Psychology of Judgement and Choice: a theoretical essay","first-page":"39","article-title":"The concepts of order and distance on sets","author":"Restle","year":"1961"},{"key":"10.1016\/0165-4896(81)90042-1_BIB22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1146\/annurev.es.05.110174.000533","article-title":"Methods of comparing classifications","volume":"5","author":"Rohlf","year":"1974","journal-title":"Annu. Rev. Ecol. Syst."},{"key":"10.1016\/0165-4896(81)90042-1_BIB23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0022-5193(67)90046-X","article-title":"Optimal classification into groups: an approach for solving the taxonomy problem","volume":"15","author":"Rubin","year":"1967","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/0165-4896(81)90042-1_BIB24","series-title":"Numerical Taxonomy","author":"Sneath","year":"1973"},{"key":"10.1016\/0165-4896(81)90042-1_BIB25","unstructured":"D.W. Turner and F.E. Tidmore, Clustering with Chernoff-type faces, Amer. Statist. Assoc. Statistical Computing Section Proc. 137th Annual Meeting, Chicago, Aug. 1977, pp. 372-377"},{"key":"10.1016\/0165-4896(81)90042-1_BIB26","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0112071","article-title":"Approximating symmetric relations by equivalence relations","volume":"12","author":"Zahn","year":"1964","journal-title":"J. Soc. Indust. Appl. Math."}],"container-title":["Mathematical Social Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165489681900421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165489681900421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:59:23Z","timestamp":1555059563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165489681900421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,5]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,5]]}},"alternative-id":["0165489681900421"],"URL":"https:\/\/doi.org\/10.1016\/0165-4896(81)90042-1","relation":{},"ISSN":["0165-4896"],"issn-type":[{"value":"0165-4896","type":"print"}],"subject":[],"published":{"date-parts":[[1981,5]]}}}