{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:41:55Z","timestamp":1742391715520},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":[[1986,8]]},"DOI":"10.1016\/0020-0190(86)90043-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"55-62","source":"Crossref","is-referenced-by-count":27,"title":["A fully distributed (minimal) spanning tree algorithm"],"prefix":"10.1016","volume":"23","author":[{"given":"Ivan","family":"Lavallee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Roucairol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90043-8_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","article-title":"A parallel algorithm for constructing minimum spanning trees","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(86)90043-8_BIB2","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1973"},{"key":"10.1016\/0020-0190(86)90043-8_BIB3","article-title":"Decentralized algorithms in distributed systems","author":"Chang","year":"1979"},{"issue":"12","key":"10.1016\/0020-0190(86)90043-8_BIB4","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1145\/359657.359665","article-title":"Reverse path forwarding of broadcast packets","volume":"21","author":"Dalal","year":"1978","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0190(86)90043-8_BIB5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Trans. Programm. Language Systems"},{"issue":"1","key":"10.1016\/0020-0190(86)90043-8_BIB6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum weight spanning trees","volume":"5","author":"Gallagher","year":"1983","journal-title":"ACM-TOPLAS"},{"key":"10.1016\/0020-0190(86)90043-8_BIB7","series-title":"Parallel Computing '83","first-page":"259","article-title":"An efficient parallel algorithm for computing a minimal spanning tree","author":"Lavallee","year":"1984"},{"key":"10.1016\/0020-0190(86)90043-8_BIB8","series-title":"Analysis and Design of Algorithm in Combinatorial Optimization","article-title":"Complexity of optimum undirected tree problem","author":"Maffioli","year":"1981"},{"key":"10.1016\/0020-0190(86)90043-8_BIB9","series-title":"Performances of Data Communication System and Their Applications","first-page":"46","article-title":"Distributed minimal spanning tree algorithms","author":"Perker","year":"1981"},{"key":"10.1016\/0020-0190(86)90043-8_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","article-title":"Termination detection for distributed computations","volume":"18","author":"Topor","year":"1984","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900438?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900438?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:50:11Z","timestamp":1553579411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0020019086900438"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90043-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}