{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:08:41Z","timestamp":1759147721603},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/0020-0190(83)90088-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"37-41","source":"Crossref","is-referenced-by-count":29,"title":["An improved algorithm for hierarchical clustering using strong components"],"prefix":"10.1016","volume":"17","author":[{"given":"Robert E.","family":"Tarjan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90088-1_BIB1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90088-1_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF02291174","article-title":"Min and max hierarchical clustering using asymmetric similarity measures","volume":"38","author":"Hubert","year":"1973","journal-title":"Psychometrika"},{"key":"10.1016\/0020-0190(83)90088-1_BIB3","first-page":"769","article-title":"A functional regionalization program based on the standardization and hierarchical clustering of transactions flow tables","volume":"4","author":"Leusmann","year":"1977","journal-title":"Comput. Appl."},{"key":"10.1016\/0020-0190(83)90088-1_BIB4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00144259","article-title":"Combinatorial procedures for structuring internal-migration and other transaction flows","volume":"15","author":"Slater","year":"1981","journal-title":"Quality and Quantity"},{"key":"10.1016\/0020-0190(83)90088-1_BIB5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90088-1_BIB6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0020-0190(82)90136-3","article-title":"A hierarchical clustering algorithm using strong components","volume":"14","author":"Tarjan","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90088-1_BIB7","series-title":"Minimum spanning trees","author":"Tarjan","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:21Z","timestamp":1555073781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0020019083900881"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90088-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}