{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:09:24Z","timestamp":1743152964289,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_43","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"407-422","source":"Crossref","is-referenced-by-count":11,"title":["A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"given":"Stephane","family":"Rovedakis","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","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"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-57271-6_35","volume-title":"Distributed Algorithms","author":"E. Anagnostou","year":"1993","unstructured":"Anagnostou, E., Hadzilacos, V.: Tolerating transient and permanent failures (extended abstract). In: Schiper, A. (ed.) WDAG 1993. LNCS, vol.\u00a0725, pp. 174\u2013188. Springer, Heidelberg (1993)"},{"key":"43_CR3","first-page":"385","volume-title":"PODC","author":"M. Ben-Or","year":"2008","unstructured":"Ben-Or, M., Dolev, D., Hoch, E.N.: Fast self-stabilizing byzantine tolerant digital clock synchronization. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 385\u2013394. ACM Press, New York (2008)"},{"issue":"5","key":"43_CR4","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1006\/jpdc.2001.1830","volume":"62","author":"J.A. Cobb","year":"2002","unstructured":"Cobb, J.A., Gouda, M.G.: Stabilization of general loop-free routing. J. Parallel Distrib. Comput.\u00a062(5), 922\u2013944 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"43_CR5","first-page":"1","volume":"1","author":"A.K. Datta","year":"2001","unstructured":"Datta, A.K., Gurumurthy, S., Petit, F., Villain, V.: Self-stabilizing network orientation algorithms in arbitrary rooted networks. Stud. Inform. Univ.\u00a01(1), 1\u201322 (2001)","journal-title":"Stud. Inform. Univ."},{"issue":"11","key":"43_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. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"43_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":"43_CR8","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":"43_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci.\u00a0(1997)","DOI":"10.4086\/cjtcs.1997.004"},{"issue":"4","key":"43_CR10","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/PL00009167","volume":"18","author":"S. Dolev","year":"1997","unstructured":"Dolev, S., Welch, J.L.: Wait-free clock synchronization. Algorithmica\u00a018(4), 486\u2013511 (1997)","journal-title":"Algorithmica"},{"issue":"5","key":"43_CR11","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S. Dolev","year":"2004","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM\u00a051(5), 780\u2013799 (2004)","journal-title":"J. ACM"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"29","author":"E.M. Gafni","year":"1981","unstructured":"Gafni, E.M., Bertsekas, P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications\u00a029, 11\u201318 (1981)","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"43_CR13","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":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/90.222913","volume":"1","author":"J.J. Garcia-Luna-Aceves","year":"1993","unstructured":"Garcia-Luna-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE\/ACM Trans. Netw.\u00a01(1), 130\u2013141 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Gopal, A.S., Perry, K.J.: Unifying self-stabilization and fault-tolerance (preliminary version). In: PODC, pp. 195\u2013206 (1993)","DOI":"10.1145\/164051.164074"},{"issue":"9","key":"43_CR16","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/32.92911","volume":"17","author":"M.G. Gouda","year":"1991","unstructured":"Gouda, M.G., Herman, T.: Adaptive programming. IEEE Trans. Software Eng.\u00a017(9), 911\u2013921 (1991)","journal-title":"IEEE Trans. Software Eng."},{"key":"43_CR17","first-page":"10","volume-title":"WSS","author":"M.G. Gouda","year":"1999","unstructured":"Gouda, M.G., Schneider, M.: Stabilization of maximal metric trees. In: Arora, A. (ed.) WSS, pp. 10\u201317. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"43_CR18","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":"43_CR19","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":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-45032-7_14","volume-title":"Self-Stabilizing Systems","author":"C. Johnen","year":"2003","unstructured":"Johnen, C., Tixeuil, S.: Route Preserving Stabilization. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 184\u2013198. Springer, Heidelberg (2003)"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Johnen, C., Tixeuil, S.: Route preserving stabilization. In: Self-Stabilizing Systems, pp. 184\u2013198 (2003)","DOI":"10.1007\/3-540-45032-7_14"},{"key":"43_CR22","doi-asserted-by":"publisher","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."},{"issue":"3","key":"43_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1142\/S0129626497000334","volume":"7","author":"M. Papatriantafilou","year":"1997","unstructured":"Papatriantafilou, M., Tsigas, P.: On self-stabilizing wait-free clock synchronization. Parallel Processing Letters\u00a07(3), 321\u2013328 (1997)","journal-title":"Parallel Processing Letters"},{"issue":"1","key":"43_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2006.08.008","volume":"67","author":"F. Petit","year":"2007","unstructured":"Petit, F., Villain, V.: Optimal snap-stabilizing depth-first token circulation in tree networks. J. Parallel Distrib. Comput.\u00a067(1), 1\u201312 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"43_CR25","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"},{"issue":"3","key":"43_CR26","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci.\u00a026(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR27","doi-asserted-by":"crossref","unstructured":"Blin, L., Potop-Butucaru, M.G., Rovedakis, S., Tixeuil, S.: A new self-stabilizing minimum spanning tree construction with loop-free property. Research Report, inria-00384041, INRIA (2009)","DOI":"10.1007\/978-3-642-04355-0_43"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:44:10Z","timestamp":1558539850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}