{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:04:35Z","timestamp":1726412675000},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019790","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"1-12","source":"Crossref","is-referenced-by-count":5,"title":["A distributed spanning tree algorithm"],"prefix":"10.1007","author":[{"given":"Karl Erik","family":"Johansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulla Lundin","family":"J\u00f8rgensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svend Hauge","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f8ren Erik","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Skyum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Francez N.: Distributed termination. ACM Trans. on Programming Languages and Systems. Vol. 2. 1980, pages 42\u201355.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"Gallager R. G., Humblet P. A., Spira P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. on Programming Languages and Systems. Vol. 5. 1983, pages 66\u201377.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","volume":"31","author":"P. A. Humblet","year":"1983","unstructured":"Humblet P. A.: A Distributed Algorithm for Minimum Weight Directed Spanning Trees. IEEE Trans. on Communications. Vol 31. 1983, pages 756\u2013762.","journal-title":"IEEE Trans. on Communications"},{"key":"1_CR4","unstructured":"Johansen K.E., J\u00f8rgensen U. L., Nielsen S. H., Nielsen S. E.: Konstruktion og analyse af distibuerede algoritmer til beregning af et udsp\u00e6ndende tr\u00e6. (In Danish) Technical report, March 1986, Aarhus University."},{"key":"1_CR5","unstructured":"Korach E., Markowitz M.: Algorithms for Distributed Spanning Tree Construction in Dynamic Networks (Extended Abstract) TECHNION Technical Report #401, February 1986."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Korach E., Moran S., Zaks S.: Tight Lower and Upper Bounds for some Distributed Algorithms for a Complete Network of Processors, Proc. of 3. Ann ACM PODC 1984, pages. 199\u2013207.","DOI":"10.1145\/800222.806747"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Korach E., Moran S., Zaks S.: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors. Proc. of 4. Ann. ACM PODC, Ontario 1985, pages 277\u2013286.","DOI":"10.1145\/323596.323622"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(86)90043-8","volume":"23","author":"I. Lavellee","year":"1986","unstructured":"Lavellee I., Roucairol G.: A Fully Distributed (Minimal) Spanning Tree Algorithm. Inf. Proc. Letters 23. 1986, pages 55\u201362.","journal-title":"Inf. Proc. Letters"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00979869","volume":"13","author":"N. Santoro","year":"1984","unstructured":"Santoro N.: On the Message Complexity of Distributed Problems. Int. Journal of Comp. and Inf. Sci. 13. 1984, pages 131\u2013147.","journal-title":"Int. Journal of Comp. and Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:39:13Z","timestamp":1586551153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0019790","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}