{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:16Z","timestamp":1761611116517},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0167-8191(89)90005-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"45-52","source":"Crossref","is-referenced-by-count":12,"title":["Minimal spanning trees: An empirical investigation of parallel algorithms"],"prefix":"10.1016","volume":"12","author":[{"given":"R.S","family":"Barr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.V","family":"Helgaon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.L","family":"Kennington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90005-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-8191(89)90005-7_BIB2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02240073","article-title":"An adaptive and cost-optimal parallel algorithm for minimum spanning trees","volume":"36","author":"Akl","year":"1986","journal-title":"Computing"},{"key":"10.1016\/0167-8191(89)90005-7_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(86)90087-9","article-title":"The asymmetric M-traveling salesman problem: A duality based branch-and-bound algorithm","volume":"13","author":"Ali","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(89)90005-7_BIB4","series-title":"Graph Theory: An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0167-8191(89)90005-7_BIB5","series-title":"Proc. 1981 International Conference on Parallel Processing","first-page":"188","article-title":"Parallel algorithms for the minimum spanning tree problem","author":"Deo","year":"1981"},{"key":"10.1016\/0167-8191(89)90005-7_BIB6","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Res."},{"key":"10.1016\/0167-8191(89)90005-7_BIB7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1970","journal-title":"Math. Program."},{"key":"10.1016\/0167-8191(89)90005-7_BIB8","series-title":"Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-8191(89)90005-7_BIB9","series-title":"Proc. 1984 International Conference on Parallel Processing","first-page":"439","article-title":"Adaptive parallel algorithms for finding minimum spanning trees","author":"Kwan","year":"1984"},{"key":"10.1016\/0167-8191(89)90005-7_BIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(86)90043-8","article-title":"A fully distributed (minimal) spanning tree algorithm","volume":"23","author":"Lavallee","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90005-7_BIB11","first-page":"259","article-title":"An efficient parallel algorithm for computing a minimum spanning tree","volume":"83","author":"Lavallee","year":"1984"},{"key":"10.1016\/0167-8191(89)90005-7_BIB12","series-title":"Parallel Computers and Computations","year":"1985"},{"issue":"1","key":"10.1016\/0167-8191(89)90005-7_BIB13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning tree problem","volume":"14","author":"Nath","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90005-7_BIB14","author":"Osterhaug","year":"1986"},{"key":"10.1016\/0167-8191(89)90005-7_BIB15","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0167-8191(89)90005-7_BIB16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(86)90098-0","article-title":"An O(log n) algorithm for parallel update of minimum spanning trees","volume":"22","author":"Pawagi","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(89)90005-7_BIB17","series-title":"Designing Efficient Algorithms for Parallel Computers","author":"Quinn","year":"1987"},{"key":"10.1016\/0167-8191(89)90005-7_BIB18","series-title":"Algorithms","author":"Sedgenwick","year":"1983"},{"key":"10.1016\/0167-8191(89)90005-7_BIB19","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:25:12Z","timestamp":1551068712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0167819189900057"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90005-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}