{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:36:36Z","timestamp":1742988996126,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022152","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"257-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A uniform self-stabilizing minimum diameter spanning tree algorithm"],"prefix":"10.1007","author":[{"given":"Franck","family":"Butelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lavault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek and G. Brown. Self-stabilization of the alternating-bit protocol. In Proc. Symp. Reliable Distr. Syst., pages 80\u201383, 1989.","DOI":"10.1109\/RELDIS.1989.72751"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Memory adaptative self-stabilizing protocols. In Proc. WDAG, pages 203\u2013220, 1992.","DOI":"10.1007\/3-540-56188-9_14"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. Optimal distributed algorithms for minimum 0weight spanning tree, counting, leader election and related problems. In Proc. ACM STOC, pages 230\u2013240, 1987.","DOI":"10.1145\/28395.28421"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, I. Cidon, and S. Kutten. Communication-optimal maintenance of replicated information. In Proc. IEEE FOCS, pages 492\u2013502, 1990.","DOI":"10.1109\/FSCS.1990.89570"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese. Time optimal self-stabilizing synchronization. In Proc. ACM STOC, 1993.","DOI":"10.1145\/167088.167256"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, B. Patt-Shamir, G. Varghese, and S. Dolev. Self-stabilization by local checking and global reset. In Proc. WDAG, pages 326\u2013339, 1994.","DOI":"10.1007\/BFb0020443"},{"key":"18_CR7","unstructured":"M. Bui and F. Butelle. Minimum diameter spanning tree. In OPOPAC Proc, Int. Workshop on Principles of Parallel Computing, pages 37\u201346. Herm\u00e8s & Inria, Nov. 1993."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"F. Butelle, C. Lavault, and M. Bui. A uniform self-stabilizing minimum diameter spanning tree algorithm. RR 95-07, LIPN, University of Paris-Nord, May 1995.","DOI":"10.1007\/BFb0022152"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P. M. Camerini","year":"1980","unstructured":"P. M. Camerini, G. Galbiati, and F. Maffioli. Complexity of spanning tree problems: Part I. Europ. J. Oper. Research, 5:346\u2013352, 1980.","journal-title":"Europ. J. Oper. Research"},{"key":"18_CR10","unstructured":"N. Christophides. Graph Theory: An algorithmic approach. Computer Science and Applied Mathematics. Academic press, 1975."},{"issue":"11","key":"18_CR11","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. CACM, 17(11):643\u2013644, 1974.","journal-title":"CACM"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"S. Dolev, A. Israeli, and S. Moran. Resource bounds on self-stabilizing message driven protocols. In Proc. ACM PODC, 1991.","DOI":"10.1145\/112600.112624"},{"key":"18_CR13","unstructured":"S. Dolev, A. Israeli, and S. Moran. Uniform dynamic self-stabilizing leader election Part 1: Complete graph protocols. In Proc. WDAG, 1991."},{"issue":"1","key":"18_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"S. Dolev, A. Israeli, and S. Moran. Self-stabilization of dynamic systems assuming read\/write atomicity. Distributed Computing, 7(1):3\u201316, 1993.","journal-title":"Distributed Computing"},{"key":"18_CR15","volume-title":"Technical report","author":"S. Dolev","year":"1995","unstructured":"S. Dolev, A. Israeli, and S. Moran. Uniform self-stabilizing leader election Part 2: General graph protocol. Technical report, Technion \u2014 Israel, Mar. 1995."},{"key":"18_CR16","unstructured":"S. Dolev. Optimal Time Self-Stabilization in Uniform Dynamic Systems. In Proc. 6th IASTED Int. Conf. on Parallel and Distributed Computing and Systems, 1994."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algo., 13:33\u201354, 1992.","journal-title":"J. Algo."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. G. Gallager","year":"1983","unstructured":"R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. TOPLAS, 5(1):66\u201377, 1983.","journal-title":"TOPLAS"},{"issue":"5","key":"18_CR19","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/0220060","volume":"20","author":"J.-M. Ho","year":"1991","unstructured":"J.-M. Ho, D. T. Lee, C.-H. Chang, and C. K. Wong. Minimum diameter spanning trees and related problems. SIAM J. Comput., 20(5):987\u2013997, Oct. 1991.","journal-title":"SIAM J. Comput."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"E. Ihler, G. Reich, and P. Wildmayer. On shortest networks for classes of points in the plane. In Int. Workshop on Comp. Geometry \u2014 Meth., Algo. and Applic., LNCS, pages 103\u2013111, Mar. 1991.","DOI":"10.1007\/3-540-54891-2_8"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"S. Katz and K. J. Perry. Self-stabilizing extensions for message-passing systems. Distributed Computing, 7(17\u201326), 1993.","DOI":"10.1007\/BF02278852"},{"key":"18_CR22","unstructured":"C. Lavault. \u00c9valuation des algorithmes distribu\u00e9s: analyse, complexit\u00e9, m\u00e9thode. Herm\u00e8s, 1995."},{"issue":"9","key":"18_CR23","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/TCOM.1979.1094552","volume":"COM-27","author":"P. M. Merlin","year":"1979","unstructured":"P. M. Merlin and A. Segall. A failsafe distributed routing protocol. IEEE Trans. Comm., COM-27(9):1280\u20131287, Sept. 1979.","journal-title":"IEEE Trans. Comm."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0376-5075(83)90034-X","volume":"7","author":"R. Perlman","year":"1983","unstructured":"R. Perlman. Fault-tolerant broadcast of routing information. Computer Networks, 7:395\u2013405, 1983.","journal-title":"Computer Networks"},{"key":"18_CR25","volume-title":"Technical report","author":"S. K. Shukla","year":"1995","unstructured":"S. K. Shukla, D. Rosenkrantz, and S. S. Ravi. Observations on self-stabilizing graph algorithm for anonymous networks. Technical report, University of Albany, NY, 1995."},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"G. Varghese. Self-stabilization by counter flushing. In Proc. ACM PODC, pages 244\u2013253, 1994.","DOI":"10.1145\/197917.198102"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:01:29Z","timestamp":1736082089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022152"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0022152","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"15 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}