{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:45:42Z","timestamp":1648536342775},"reference-count":29,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1093\/comjnl\/bxv110","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T13:07:55Z","timestamp":1449839275000},"page":"225-243","source":"Crossref","is-referenced-by-count":1,"title":["A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free Property"],"prefix":"10.1093","volume":"59","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Rovedakis","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"2016020108184241000_59.2.225.1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"2016020108184241000_59.2.225.2","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"2016020108184241000_59.2.225.3","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"2016020108184241000_59.2.225.4","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"2016020108184241000_59.2.225.5","doi-asserted-by":"crossref","unstructured":"Dolev S. (2000) Self-Stabilization. MIT Press.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"2016020108184241000_59.2.225.6","unstructured":"Dolev S. and Herman T. (1997) Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci., 1997."},{"key":"2016020108184241000_59.2.225.7","unstructured":"Gopal A.S. and Perry K.J. (1993) Unifying Self-stabilization and Fault-tolerance (Preliminary Version). Proc. 12th Annual ACM Symp. on Principles of Distributed Computing, Ithaca, New York, USA, August 15\u201318, pp. 195\u2013206."},{"key":"2016020108184241000_59.2.225.8","doi-asserted-by":"crossref","unstructured":"Anagnostou E. and Hadzilacos V. (1993) Tolerating Transient and Permanent Failures (Extended Abstract). Proc. 7th Int. Workshop on Distributed Algorithms, WDAG'93, Lausanne, Switzerland, September 27\u201329, pp. 174\u2013188.","DOI":"10.1007\/3-540-57271-6_35"},{"key":"2016020108184241000_59.2.225.9","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009167"},{"key":"2016020108184241000_59.2.225.10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000334"},{"key":"2016020108184241000_59.2.225.11","doi-asserted-by":"publisher","DOI":"10.1145\/1017460.1017463"},{"key":"2016020108184241000_59.2.225.12","doi-asserted-by":"crossref","unstructured":"Ben-Or M. , Dolev D. and Hoch E.N. (2008) Fast Self-stabilizing Byzantine Tolerant Digital Clock Synchronization. Proc. 27th Annual ACM Symp. Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18\u201321, pp. 385\u2013394.","DOI":"10.1145\/1400751.1400802"},{"key":"2016020108184241000_59.2.225.13","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1830"},{"key":"2016020108184241000_59.2.225.14","doi-asserted-by":"crossref","unstructured":"Johnen C. and Tixeuil S. (2003) Route Preserving Stabilization. Self-Stabilizing Syst., pp. 184\u2013198.","DOI":"10.1007\/3-540-45032-7_14"},{"key":"2016020108184241000_59.2.225.15","doi-asserted-by":"publisher","DOI":"10.1109\/90.222913"},{"key":"2016020108184241000_59.2.225.16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"2016020108184241000_59.2.225.17","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(02)00029-1"},{"key":"2016020108184241000_59.2.225.18","doi-asserted-by":"crossref","unstructured":"Higham L. and Liang Z. (2001) Self-stabilizing Minimum Spanning Tree Construction on Message-passing Networks. DISC, pp. 194\u2013208.","DOI":"10.1007\/3-540-45414-4_14"},{"key":"2016020108184241000_59.2.225.19","unstructured":"Blin L. , Dolev S. , Potop-Butucaru M.G. and Rovedakis S. (2010) Fast Self-stabilizing Minimum Spanning Tree Construction- using Compact Nearest Common Ancestor Labeling Scheme. DISC, pp. 480\u2013494."},{"key":"2016020108184241000_59.2.225.20","doi-asserted-by":"crossref","unstructured":"Gouda M.G. and Schneider M. (1999) Stabilization of Maximal Metric Trees. Proc. 1999 ICDCS Workshop on Self-stabilizing Systems, Austin, Texas, June 5, pp. 10\u201317,","DOI":"10.1109\/SLFSTB.1999.777481"},{"key":"2016020108184241000_59.2.225.21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278852"},{"key":"2016020108184241000_59.2.225.22","doi-asserted-by":"crossref","unstructured":"Blin L. , Potop-Butucaru M. , Rovedakis S. and Tixeuil S. (2009) A New Self-stabilizing Minimum Spanning Tree Construction with Loop-free Property. Distributed Computing, 23rd International Symposium, DISC 2009, Proceedings, Elche, Spain, September 23\u201325, pp. 407\u2013 422.","DOI":"10.1007\/978-3-642-04355-0_43"},{"key":"2016020108184241000_59.2.225.23","first-page":"1","article-title":"Self-stabilizing network orientation algorithms in arbitrary rooted networks","volume":"1","author":"Datta","year":"2001","journal-title":"Stud. Inform. Univ."},{"key":"2016020108184241000_59.2.225.24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.008"},{"key":"2016020108184241000_59.2.225.25","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008934"},{"key":"2016020108184241000_59.2.225.26","doi-asserted-by":"crossref","unstructured":"Tel G. (1994) Introduction to Distributed Algorithms. Cambridge University Press.","DOI":"10.1007\/BFb0020419"},{"key":"2016020108184241000_59.2.225.27","doi-asserted-by":"publisher","DOI":"10.1109\/32.92911"},{"key":"2016020108184241000_59.2.225.28","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"2016020108184241000_59.2.225.29","doi-asserted-by":"crossref","unstructured":"Blin L. , Potop-Butucaru M.G. , Rovedakis S. and Tixeuil S. (2010) Loop-free Super-stabilizing Spanning Tree Construction. Proc. 12th Int. Symp. Stabilization, Safety, and Security of Distributed Systems - SSS 2010, New York, NY, USA, September 20\u201322, pp. 50\u201364.","DOI":"10.1007\/978-3-642-16023-3_7"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/2\/225\/7903648\/bxv110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T10:44:51Z","timestamp":1567421091000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,9]]},"references-count":29,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,2,1]]},"published-print":{"date-parts":[[2016,2]]}},"alternative-id":["10.1093\/comjnl\/bxv110"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv110","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,9]]}}}