{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:10:59Z","timestamp":1740719459783,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11549468_68","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"606-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding"],"prefix":"10.1007","author":[{"given":"Vijay K.","family":"Garg","sequence":"first","affiliation":[]},{"given":"Anurag","family":"Agarwal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-54099-7_2","volume-title":"Proc. of the 4th Int\u2019l Workshop on Distributed Algorithms","author":"Y. Afek","year":"1991","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: Proc. of the 4th Int\u2019l Workshop on Distributed Algorithms, pp. 15\u201328. Springer, Heidelberg (1991)"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithm. In: Proc. of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 400\u2013410 (1993)","DOI":"10.1007\/3-540-57529-4_72"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Antonoiu, G., Srimani, P.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: European Conference on Parallel Processing, pp. 480\u2013487 (1997)","DOI":"10.1007\/BFb0002773"},{"issue":"9","key":"68_CR4","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A. Arora","year":"1994","unstructured":"Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers\u00a043(9), 1026\u20131038 (1994)","journal-title":"IEEE Transactions on Computers"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 268\u2013277 (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"issue":"6","key":"68_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(94)90103-1","volume":"49","author":"Z. Collin","year":"1994","unstructured":"Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Information Processing Letters\u00a049(6), 297\u2013301 (1994)","journal-title":"Information Processing Letters"},{"key":"68_CR7","first-page":"65","volume":"151","author":"N. Deo","year":"2001","unstructured":"Deo, N., Micikevicius, P.: Prufer-like codes for labeled trees. Congressus Numerantium\u00a0151, 65\u201373 (2001)","journal-title":"Congressus Numerantium"},{"key":"68_CR8","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. Communications of the ACM\u00a017, 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"68_CR9","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":"68_CR10","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems. In: MCC Workshop on Self-Stabilizing Systems (1989)"},{"key":"68_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/93385.93407","volume-title":"Proc. of the ninth annual ACM symposium on Principles of Distributed Computing","author":"S. Dolev","year":"1990","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. In: Proc. of the ninth annual ACM symposium on Principles of Distributed Computing, pp. 103\u2013117. ACM Press, New York (1990)"},{"key":"68_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform self-stabilizing leader election. In: Proc. of the 5th Workshop on Distributed Algorithms, pp. 167\u2013180 (1991)","DOI":"10.1007\/BFb0022445"},{"key":"68_CR13","unstructured":"Gaertner, F.C.: A survey of self-stabilizing spanning-tree construction algorithms. Technical report, EPFL (October 2003)"},{"key":"68_CR14","unstructured":"Garg, V.K., Agarwal, A.: Self-stabilizing spanning tree algorithm with a new design methodology. Technical report, University of Texas at Austin (2004), Available as http:\/\/maple.ece.utexas.edu\/TechReports\/2004\/TR-PDS-2004-001.ps"},{"key":"68_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(92)90264-V","volume":"41","author":"S. Huang","year":"1992","unstructured":"Huang, S., Chen, N.: A self stabilizing algorithm for constructing breadth first trees. Information Processing Letters\u00a041, 109\u2013117 (1992)","journal-title":"Information Processing Letters"},{"key":"68_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/259380.259508","volume-title":"Proc. of the sixteenth annual ACM symposium on Principles of Distributed Computing","author":"C. Johnen","year":"1997","unstructured":"Johnen, C.: Memory efficient, self-stabilizing algorithm to construct bfs spanning trees. In: Proc. of the sixteenth annual ACM symposium on Principles of Distributed Computing, p. 288. ACM Press, New York (1997)"},{"key":"68_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"68_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S030500410002853X","volume":"49","author":"E.H. Neville","year":"1953","unstructured":"Neville, E.H.: The codifying of tree-structure. Proceedings of Cambridge Philosophical Society\u00a049, 381\u2013385 (1953)","journal-title":"Proceedings of Cambridge Philosophical Society"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:21:49Z","timestamp":1740633709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11549468_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}