{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:31:44Z","timestamp":1756308704914,"version":"3.40.5"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_19","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"277-292","source":"Crossref","is-referenced-by-count":8,"title":["Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case"],"prefix":"10.1007","author":[{"given":"Matthieu","family":"Barjon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Casteigts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Chaumette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colette","family":"Johnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yessin M.","family":"Neggaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abbas, S., Mosbah, M., Zemmari, A.: Distributed computation of a spanning tree in a dynamic graph by mobile agents. In: Proc. of IEEE Int. Conference on Engineering of Intelligent Systems (ICEIS), pp. 1\u20136 (2006)","DOI":"10.1109\/ICEIS.2006.1703205"},{"key":"19_CR2","unstructured":"Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (2002)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Cidon, I., Kutten, S.: Optimal maintenance of a spanning tree. J. ACM\u00a055(4), 18:1\u201318:45 (2008)","DOI":"10.1145\/1391289.1391292"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 278\u2013281. ACM (1984)","DOI":"10.1145\/800222.806754"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0743-7315(02)00028-X","volume":"63","author":"H. Baala","year":"2003","unstructured":"Baala, H., Flauzac, O., Gaber, J., Bui, M., El-Ghazawi, T.: A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. Journal of Parallel and Distributed Computing\u00a063, 97\u2013104 (2003)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-51687-5_27","volume-title":"Distributed Algorithms","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Zernik, D.: Random leaders and random spanning trees. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 1\u201312. Springer, Heidelberg (1989)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Barjon, M., Casteigts, A., Chaumette, S., Johnen, C., Neggaz, Y.M.: Maintaining a spanning forest in highly dynamic networks: The synchronous case. CoRR, abs\/1410.4373 (2014)","DOI":"10.1007\/978-3-319-14472-6_19"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jpdc.2012.10.006","volume":"73","author":"T. Bernard","year":"2013","unstructured":"Bernard, T., Bui, A., Sohier, D.: Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave. J. Parallel Distrib. Comput.\u00a073(2), 137\u2013149 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75142-7_10","volume-title":"Distributed Computing","author":"J. Burman","year":"2007","unstructured":"Burman, J., Kutten, S.: Time optimal asynchronous self-stabilizing spanning tree. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 92\u2013107. Springer, Heidelberg (2007)"},{"key":"19_CR10","unstructured":"Casteigts, A.: The JBotSim library. CoRR, abs\/1001.1435 (2013), See also the project website at http:\/\/jbotsim.sourceforge.net"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-642-39247-4_9","volume-title":"Ad-hoc, Mobile, and Wireless Network","author":"A. Casteigts","year":"2013","unstructured":"Casteigts, A., Chaumette, S., Guinand, F., Pign\u00e9, Y.: Distributed maintenance of anytime available spanning trees in dynamic networks. In: Cicho\u0144, J., G\u0119bala, M., Klonowski, M. (eds.) ADHOC-NOW 2013. LNCS, vol.\u00a07960, pp. 99\u2013110. Springer, Heidelberg (2013)"},{"key":"19_CR12","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. CoRR, abs\/1210.3277 (2014)"},{"key":"19_CR13","unstructured":"Ferreira, A.: On models and algorithms for dynamic communication networks: The case for evolving graphs. In: Proc. ALGOTEL (2002)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: Proceedings of the Ninth Annual ACM symposium on Principles of Distributed Computing, pp. 119\u2013131. ACM (1990)","DOI":"10.1145\/93385.93409"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-41527-2_7","volume-title":"Distributed Computing","author":"A. Kravchik","year":"2013","unstructured":"Kravchik, A., Kutten, S.: Time optimal synchronous self stabilizing spanning tree. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 91\u2013105. Springer, Heidelberg (2013)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42nd ACM symposium on Theory of computing (STOC), pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"key":"19_CR17","unstructured":"Litovsky, I., Metivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Handbook of Graph Grammars and Computing by Graph Transformation. Citeseer (2001)"},{"key":"19_CR18","unstructured":"Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: Crawdad trace cambridge\/haggle\/imote\/infocom (January 31, 2006), http:\/\/crawdad.cs.dartmouth.edu\/cambridge\/haggle\/imote\/infocom"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:02:12Z","timestamp":1747180932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}