{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:03:53Z","timestamp":1725728633542},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392467"},{"type":"electronic","value":"9783642392474"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39247-4_9","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:43:18Z","timestamp":1370310198000},"page":"99-110","source":"Crossref","is-referenced-by-count":8,"title":["Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Casteigts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Chaumette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Guinand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoann","family":"Pign\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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)"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"D.J. Aldous","year":"1990","unstructured":"Aldous, D.J.: The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discret. Math.\u00a03(4), 450\u2013465 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: Proc. of the 25th ACM Symp. on Theory of Computing (STOC), New York, USA, pp. 652\u2013661 (1993)","DOI":"10.1145\/167088.167256"},{"key":"9_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":"9_CR6","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":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing random walks and voting on graphs. In: Proc. of the 31st ACM Symp. on Principles of Distributed Computing (PODC), pp. 47\u201356 (2012)","DOI":"10.1145\/2332432.2332440"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proc. of Int. Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 27\u201334 (2003)","DOI":"10.1145\/863956.863960"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A. Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Network\u00a018(5), 24\u201329 (2004)","journal-title":"IEEE Network"},{"key":"9_CR10","unstructured":"Gaertner, F.C.: A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms. Technical report, EPFL (2003)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Litovsky, I., M\u00e9tivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a0III, pp. 1\u201356. World Scientific Publishing (1999)","DOI":"10.1142\/9789812814951_0001"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Network"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39247-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:47:16Z","timestamp":1558316836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39247-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392467","9783642392474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39247-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}