{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:22Z","timestamp":1725663322512},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:29:29Z","timestamp":1330208969000},"page":"122-132","source":"Crossref","is-referenced-by-count":1,"title":["Distributed algorithms for reconstructing MST after topology change"],"prefix":"10.1007","author":[{"given":"Jungho","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken'ich","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch: \"Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and related problems\", Proceedings 19th Annual ACM Symposium on Theory of Computing, pp.230\u2013240(1987).","DOI":"10.1145\/28395.28421"},{"key":"9_CR2","unstructured":"I.Cimet and S.P.Kumar: \"A Resilient Distributed Algorithms for Minimum Weight Spanning Trees\", Proceedings of the 1987 International Conference on Parallel Processing., pp.196\u2013203(1987)."},{"issue":"1","key":"9_CR3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"R. Gallager, P. Humblet and P. Spira: \"A Distributed Algorithm for Minimum Weight Spanning Trees\", ACM TOPLAS, 5, 1, pp.66\u201377(1983).","journal-title":"ACM TOPLAS"},{"key":"9_CR4","unstructured":"J.Park, T.Masuzawa, K.Hagihara and N.Tokura: \"Distributed Algorithms for Reconstructing Minimum Spanning Tree \u2014 The Case of Link Deletions \u2014\", Tech. Rep. IECEJ, COMP-89-25(in Japanese) (1989)."},{"key":"9_CR5","unstructured":"Y.H.Tsin: \"An Asynchronous Distributed MST Updating Algorithm for Handling Vertex Insertions in Networks\", Proc. of the International Conference on Parallel Processing and Applications, pp.221\u2013226(1987)."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:19:44Z","timestamp":1619572784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}