{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T08:00:11Z","timestamp":1759564811550},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0167-6423(83)90011-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"205-216","source":"Crossref","is-referenced-by-count":6,"title":["An alternative for the implementation of Kruskal's minimal spanning tree algorithm"],"prefix":"10.1016","volume":"3","author":[{"given":"Jyrki","family":"Katajainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olli","family":"Nevalainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(83)90011-4_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0196-6774(82)90003-7","article-title":"On the average-case complexity of \u201cbucketing\u201d algorithms","volume":"3","author":"Akl","year":"1982","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/0167-6423(83)90011-4_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/opre.27.1.161","article-title":"Shortest-route methods: 1, reaching, pruning and buckets","volume":"27","author":"Denardo","year":"1979","journal-title":"Operations Res."},{"issue":"1","key":"10.1016\/0167-6423(83)90011-4_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02243418","article-title":"Average time behavior of distributive sorting algorithms","volume":"26","author":"Devroye","year":"1981","journal-title":"Computing"},{"key":"10.1016\/0167-6423(83)90011-4_BIB4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","article-title":"A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees","volume":"9","author":"Dial","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0167-6423(83)90011-4_BIB5","unstructured":"W. Feurzeig, Algorithm 23: Math sort, Collected algorithms from ACM."},{"key":"10.1016\/0167-6423(83)90011-4_BIB6","series-title":"Technical Report # 354","article-title":"Computational methods for minimum spanning tree problems","author":"Haymond","year":"1980"},{"key":"10.1016\/0167-6423(83)90011-4_BIB7","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0167-6423(83)90011-4_BIB8","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/800193.569966","article-title":"Computing minimum spanning trees efficiently","author":"Kershenbaum","year":"1972","journal-title":"Proc. 25th Annual Conference of the ACM"},{"key":"10.1016\/0167-6423(83)90011-4_BIB9","series-title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-6423(83)90011-4_BIB10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(78)90009-9","article-title":"The expected linearity of a simple equivalence algorithm","volume":"6","author":"Knuth","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0167-6423(83)90011-4_BIB11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(80)90143-X","article-title":"The design and analysis of a new hybrid sorting algorithm","volume":"10","author":"Meijer","year":"1980","journal-title":"Information Processing Lett."},{"key":"10.1016\/0167-6423(83)90011-4_BIB12","series-title":"Implementation of a distributive sorting algorithm","author":"Nevalainen","year":"1981"},{"issue":"2","key":"10.1016\/0167-6423(83)90011-4_BIB13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(83)90011-4_BIB14","series-title":"Ph.D. Thesis","article-title":"Statistical methods in algorithm design and analysis","author":"Weide","year":"1978"},{"issue":"4","key":"10.1016\/0167-6423(83)90011-4_BIB15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/361284.361299","article-title":"Algorithm 422: Minimal spanning tree","volume":"15","author":"Whitney","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(83)90011-4_BIB16","first-page":"192","article-title":"On the average behavior of a set merging algorithms","author":"Yao","year":"1976","journal-title":"Proc. 8th Annual Symposium on Theory of Computing"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:50:07Z","timestamp":1555077007000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0167642383900114"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90011-4","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}