{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:08:29Z","timestamp":1775254109363,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030032319","type":"print"},{"value":"9783030032326","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_13","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"186-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Acyclic Strategy for Silent Self-stabilization in Spanning Forests"],"prefix":"10.1007","author":[{"given":"Karine","family":"Altisen","sequence":"first","affiliation":[]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[]},{"given":"Ana\u00efs","family":"Durand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ic.2016.09.002","volume":"254","author":"K Altisen","year":"2017","unstructured":"Altisen, K., Cournier, A., Devismes, S., Durand, A., Petit, F.: Self-stabilizing leader election in polynomial steps. Inf. Comput. 254, 330\u2013366 (2017)","journal-title":"Inf. Comput."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arora, A., Gouda, M., Herman, T.: Composite routing protocols. In: SPDP 1990, pp. 70\u201378 (1990)","DOI":"10.1109\/SPDP.1990.143510"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-11764-5_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Blin","year":"2014","unstructured":"Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 18\u201332. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_2"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-16023-3_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Blin","year":"2010","unstructured":"Blin, L., Potop-Butucaru, M.G., Rovedakis, S., Tixeuil, S.: Loop-free super-stabilizing spanning tree construction. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 50\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16023-3_7"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00446-017-0294-2","volume":"31","author":"L Blin","year":"2018","unstructured":"Blin, L., Tixeuil, S.: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Dist. Comp. 31(2), 139\u2013166 (2018)","journal-title":"Dist. Comp."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s006070050013","volume":"62","author":"P Chaudhuri","year":"1999","unstructured":"Chaudhuri, P.: An $$O(n^2)$$ self-stabilizing algorithm for computing bridge-connected components. Computing 62(1), 55\u201367 (1999)","journal-title":"Computing"},{"issue":"14","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/S1383-7621(98)00062-9","volume":"45","author":"P Chaudhuri","year":"1999","unstructured":"Chaudhuri, P.: A note on self-stabilizing articulation point detection. J. Syst. Arch. 45(14), 1249\u20131252 (1999)","journal-title":"J. Syst. Arch."},{"issue":"5","key":"13_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1080\/00207160512331331066","volume":"82","author":"P Chaudhuri","year":"2005","unstructured":"Chaudhuri, P., Thompson, H.: Self-stabilizing tree ranking. Int. J. Comput. Math. 82(5), 529\u2013539 (2005)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s11786-011-0081-6","volume":"5","author":"P Chaudhuri","year":"2011","unstructured":"Chaudhuri, P., Thompson, H.: Improved self-stabilizing algorithms for l(2, 1)-labeling tree networks. Math. Comput. Sci. 5(1), 27\u201339 (2011)","journal-title":"Math. Comput. Sci."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/1462187.1462193","volume":"4","author":"A Cournier","year":"2009","unstructured":"Cournier, A., Devismes, S., Villain, V.: Light enabling snap-stabilization of fundamental protocols. TAAS 4(1), 6:1\u20136:27 (2009)","journal-title":"TAAS"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2016.02.010","volume":"626","author":"AK Datta","year":"2016","unstructured":"Datta, A.K., Devismes, S., Heurtefeux, K., Larmore, L.L., Rivierre, Y.: Competitive self-stabilizing $$k$$-clustering. TCS 626, 110\u2013133 (2016)","journal-title":"TCS"},{"issue":"11","key":"13_CR12","first-page":"1532","volume":"71","author":"AK Datta","year":"2011","unstructured":"Datta, A.K., Larmore, L.L., Vemula, P.: An $${O}({N})$$-time self-stabilizing leader election algorithm. JPDC 71(11), 1532\u20131544 (2011)","journal-title":"JPDC"},{"issue":"10","key":"13_CR13","doi-asserted-by":"publisher","first-page":"498","DOI":"10.2514\/1.19848","volume":"3","author":"S Dela\u00ebt","year":"2006","unstructured":"Dela\u00ebt, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. JACIC 3(10), 498\u2013514 (2006)","journal-title":"JACIC"},{"issue":"1\u20132","key":"13_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1142\/S0129626405002143","volume":"15","author":"S Devismes","year":"2005","unstructured":"Devismes, S.: A silent self-stabilizing algorithm for finding cut-nodes and bridges. Parallel Process. Lett. 15(1\u20132), 183\u2013198 (2005)","journal-title":"Parallel Process. Lett."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Devismes, S., Ilcinkas, D., Johnen, C.: Silent self-stabilizing scheme for spanning-tree-like constructions. Technical report, HAL (2018)","DOI":"10.1145\/3288599.3288607"},{"key":"13_CR16","first-page":"11","volume":"97","author":"S Devismes","year":"2016","unstructured":"Devismes, S., Johnen, C.: Silent self-stabilizing BFS tree algorithms revisited. JPDC 97, 11\u201323 (2016)","journal-title":"JPDC"},{"issue":"6","key":"13_CR17","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s002360050180","volume":"36","author":"S Dolev","year":"1999","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447\u2013462 (1999)","journal-title":"Acta Inf."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/PL00008934","volume":"14","author":"B Ducourthial","year":"2001","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Dist. Comp. 14(3), 147\u2013162 (2001)","journal-title":"Dist. Comp."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S Ghosh","year":"1993","unstructured":"Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Dist. Comp. 7(1), 55\u201359 (1993)","journal-title":"Dist. Comp."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-11764-5_9","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Christian","year":"2014","unstructured":"Christian, G., Nicolas, H., David, I., Colette, J.: Disconnected components detection and rooted shortest-path tree maintenance in networks. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 120\u2013134. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_9"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(92)90264-V","volume":"41","author":"S-T Huang","year":"1992","unstructured":"Huang, S.-T., Chen, N.-S.: A self-stabilizing algorithm for constructing breadth-first trees. IPL 41(2), 109\u2013117 (1992)","journal-title":"IPL"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1142\/S0129054199000046","volume":"10","author":"MH Karaata","year":"1999","unstructured":"Karaata, M.H.: A self-stabilizing algorithm for finding articulation points. Int. J. Found. Comput. Sci. 10(1), 33\u201346 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"13_CR23","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. Dist. Comp. 7(1), 17\u201326 (1993)","journal-title":"Dist. Comp."},{"issue":"4","key":"13_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Dist. Comp. 22(4), 215\u2013233 (2010)","journal-title":"Dist. Comp."},{"key":"13_CR25","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2001","unstructured":"Tel, G.: Introduction to Distributed Algorithms, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.7155\/jgaa.00354","volume":"19","author":"V Turau","year":"2015","unstructured":"Turau, V., K\u00f6hler, S.: A distributed algorithm for minimum distance-k domination in trees. J. Graph Algorithms Appl. 19(1), 223\u2013242 (2015)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:49:27Z","timestamp":1775249367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}