{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:08Z","timestamp":1759637768337},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770954"},{"type":"electronic","value":"9783540770961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77096-1_22","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T07:44:46Z","timestamp":1207899886000},"page":"301-314","source":"Crossref","is-referenced-by-count":6,"title":["On the Self-stabilization of Mobile Robots in Graphs"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Gradinariu Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 1070\u20131078, New Orleans, LA, USA (January 2004)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). In: STOC, pp. 82\u201393. ACM (1980)","DOI":"10.1145\/800141.804655"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC, pp. 290\u2013299 (2004)","DOI":"10.1145\/1011767.1011810"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 235\u2013253 (March 2006)","DOI":"10.1007\/s00446-005-0138-3"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","first-page":"103","volume-title":"Principles of Distributed Systems; 9th International Conference, OPODIS 2005","author":"D. Angluin","year":"2005","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 103\u2013117. Springer, Heidelberg (2005)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45438-1_3","volume-title":"Self-Stabilizing Systems","author":"J. Beauquier","year":"2001","unstructured":"Beauquier, J., Herault, T., Schiller, E.: Easy Stabilization with an Agent. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 35\u201351. Springer, Heidelberg (2001)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Parv\u00e9dy, P.R.: Fault-tolerant and self-stabilizing mobile robots gathering. In: DISC, pp. 46\u201360 (2006)","DOI":"10.1007\/11864219_4"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A. Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046(1), 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: optimal mobile agent protocols. In: PODC, pp. 153\u2013161 (2002)","DOI":"10.1145\/571825.571853"},{"key":"22_CR10","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":"22_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks.In: Reliable Distributed Systems, 2002. Proceedings. 21st IEEE Symposium on, pp. 70\u201379 (2002)","DOI":"10.1145\/571825.571872"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms\u00a06(1), 51\u201354 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Distributed coordination of a set of autonomous mobile robots. IVS, 480\u2013485, (2000)","DOI":"10.1109\/IVS.2000.898389"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11549345_32","volume-title":"Mathematical Foundations of Computer Science 2005","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Fraigniaud, P., Nisse, N.: Nondeterministic Graph Searching: From Pathwidth to Treewidth. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 364\u2013375. Springer, Heidelberg (2005)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11685654_1","volume-title":"Theoretical Computer Science","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Ilcinkas, D., Rajsbaum, S., Tixeuil, S.: The Reduced Automata Technique for Graph Exploration Space Lower Bounds. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol.\u00a03895, pp. 1\u201326. Springer, Heidelberg (2006)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-44968-X_24","volume-title":"Computing and Combinatorics (COCOON 2000), Springer LNCS","author":"S. Ghosh","year":"2000","unstructured":"Ghosh, S.: Agents, distributed algorithms, and stabilization. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 242\u2013251. Springer, Heidelberg (2000)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-45438-1_11","volume-title":"WSS01 Proceedings of the Fifth International Workshop on Self-Stabilizing Systems, Springer LNCS","author":"T. Herman","year":"2001","unstructured":"Herman, T., Masuzawa, T.: Self-Stabilizing Agent Traversal. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 152\u2013166. Springer, Heidelberg (2001)"},{"key":"22_CR18","unstructured":"Prencipe, G.: Corda: Distributed coordination of a set of autonomous mobile robots.In: Proc. ERSADS, pp. 185\u2013190, (May 2001)"},{"key":"22_CR19","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots\u2014formation and agreement problems.In: Proceedings of the 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 1996), Siena, Italy, (June 1996)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Tetali, P., Winkler, P.: On a random walk problem arising in self-stabilizing token management. In: PODC, pp. 273\u2013280 (1991)","DOI":"10.1145\/112600.112623"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst.\u00a07(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distrib. Syst.\u00a07(1), 90\u201396 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77096-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:08Z","timestamp":1619506808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77096-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770954","9783540770961"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77096-1_22","relation":{},"subject":[]}}