{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:12:54Z","timestamp":1725574374002},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207450"},{"type":"electronic","value":"9783540246046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24604-6_4","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T22:39:36Z","timestamp":1294353576000},"page":"33-44","source":"Crossref","is-referenced-by-count":0,"title":["Decomposable Algorithms for Computing Minimum Spanning Tree"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Khedr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0255(97)00002-9","volume":"101","author":"H. Abdel-Wahab","year":"1997","unstructured":"Abdel-Wahab, H., Stoica, I., Sultan, F., Wilson, K.: A Simple Algorithm for Computing Minimum Spanning Trees in the Internet. Information Sciences\u00a0101(1-2), 47\u201369 (1997)","journal-title":"Information Sciences"},{"key":"4_CR2","unstructured":"Berman, K.A., Paul, J.L.: Fundamentals of Sequential and Parallel Algorithms. PWS Publishing Company (1997)"},{"issue":"1-2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<187::AID-RSA10>3.0.CO;2-6","volume":"10","author":"C. Mcdiarmid","year":"1997","unstructured":"Mcdiarmid, C., Johnson, T., Stone, H.S.: On finding a minimum spanning tree in a network with random weights. Random Structures and Algorithms\u00a010(1-2), 187\u2013204 (1997)","journal-title":"Random Structures and Algorithms"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Gallager, R.G., et al.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transaction on programming and Systems\u00a05, 66\u201377","DOI":"10.1145\/357195.357200"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: ON the History of the Minimum Spanning Tree Problem. Annals Of the History of Computing\u00a07, 43\u201357 (1985)","journal-title":"Annals Of the History of Computing"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/jpdc.1996.0152","volume":"39","author":"I. Toica","year":"1996","unstructured":"Toica, I., Sultan, F.: Keyes A Hyperbolic Model for Communication in Layered Parallel Processing Environments. Journal of Parallel and Distributed Computing\u00a039(1), 29\u201345 (1996)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Klein, P.N., Targan, R.E.: A randomized linear -time algorithm to find minimum spanning tree. Journal of the Association for Computing Machinery\u00a042\/2, 321\u2013328","DOI":"10.1145\/201019.201022"},{"key":"4_CR8","volume-title":"Lynch Distributed Algorithms","author":"A. Nancy","year":"1996","unstructured":"Nancy, A.: Lynch Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco (1996)"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(97)00050-1","volume":"62","author":"V. King","year":"1997","unstructured":"King, V., Poon, C.K., Ramachandran, V., Sinha, S.: An optimal EREW PRAM algorithm for minimum spanning tree verification. Information Processing Letters\u00a062(3), 153\u2013159 (1997)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing - IWDC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24604-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:04:46Z","timestamp":1559912686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24604-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207450","9783540246046"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24604-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}