{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:33:26Z","timestamp":1740461606151,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_46","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"480-494","source":"Crossref","is-referenced-by-count":9,"title":["Fast Self-stabilizing Minimum Spanning Tree Construction"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[]},{"given":"Maria Gradinariu","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Rovedakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"46_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-004-1155-5","volume":"37","author":"A. Stephen","year":"2004","unstructured":"Stephen, A., Cyril, G., Haim, K., Theis, R.: Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory of Computing Systems\u00a037(3), 441\u2013456 (2004)","journal-title":"Theory of Computing Systems"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-04355-0_43","volume-title":"Distributed Computing","author":"L. Blin","year":"2009","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 407\u2013422. Springer, Heidelberg (2009)"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-54099-7_9","volume-title":"Distributed Algorithms","author":"J. Park","year":"1991","unstructured":"Park, J., Masuzawa, T., Hagihara, K., Tokura, N.: Distributed Algorithms for Reconstructing MST after Topology Change. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol.\u00a0486, pp. 122\u2013132. Springer, Heidelberg (1991)"},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/scj.4690230301","volume":"23","author":"J. Park","year":"1992","unstructured":"Park, J., Masuzawa, T., Hagihara, K., Tokura, N.: Efficient distributed algorithm to solve updating minimum spanning tree problem. Systems and Computers in Japan\u00a023(3), 1\u201312 (1992)","journal-title":"Systems and Computers in Japan"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Bein, D., Datta, A.K., Villain, V.: Self-Stablizing Pivot Interval Routing in General Networks. In: ISPAN, pp. 282\u2013287 (2005)","DOI":"10.1109\/ISPAN.2005.79"},{"issue":"11","key":"46_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM Commun.\u00a017(11), 643\u2013644 (1974)","journal-title":"ACM Commun."},{"key":"46_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"46_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithm","author":"G. Tel","year":"2000","unstructured":"Tel, G.: Introduction to distributed algorithm, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"issue":"1","key":"46_CR9","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. Program. Lang. Syst.\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"46_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal Computing"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45414-4_14","volume-title":"Distributed Computing","author":"L. Higham","year":"2001","unstructured":"Higham, L., Liang, Z.: Self-stabilizing minimum spanning tree construction on message-passing networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 194\u2013208. Springer, Heidelberg (2001)"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02278852","volume":"7","author":"S. Katz","year":"1993","unstructured":"Katz, S., Perry, K.J.: Self-stabilizing extensions for message-passing systems. Distributed Computing\u00a07, 17\u201326 (1993)","journal-title":"Distributed Computing"},{"issue":"1","key":"46_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0743-7315(02)00029-1","volume":"63","author":"S.K.S. Gupta","year":"2003","unstructured":"Gupta, S.K.S., Srimani, P.K.: Self-stabilizing multicast protocols for ad hoc networks. J. Parallel Distrib. Comput.\u00a063(1), 87\u201396 (2003)","journal-title":"J. Parallel Distrib. Comput."},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech. J, 1389\u20131401 (1957)","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S.: Fast Self-Stabilizing Minimum Spanning Tree Construction. Research Report, hal-00492398, HAL (2010)","DOI":"10.1007\/978-3-642-15763-9_46"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:54:52Z","timestamp":1740441292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_46"}},"subtitle":["Using Compact Nearest Common Ancestor Labeling Scheme"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}