{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:45:38Z","timestamp":1725752738509},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030883"},{"type":"electronic","value":"9783319030890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03089-0_5","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"61-73","source":"Crossref","is-referenced-by-count":2,"title":["Self-stabilizing (f,g)-Alliances with Safe Convergence"],"prefix":"10.1007","author":[{"given":"Fabienne","family":"Carrier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajoy K.","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvan","family":"Rivierre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D. Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing\u00a020(4), 279\u2013304 (2007)","journal-title":"Distributed Computing"},{"key":"5_CR2","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. Commun. ACM\u00a017, 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory Requirements for Silent Stabilization. In: PODC, pp. 27\u201334 (1996)","key":"5_CR3","DOI":"10.1145\/248052.248055"},{"unstructured":"Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci.\u00a0(1997)","key":"5_CR4"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-24550-3_15","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M.C. Dourado","year":"2011","unstructured":"Dourado, M.C., Penso, L.D., Rautenbach, D., Szwarcfiter, J.L.: The south zone: Distributed algorithms for alliances. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol.\u00a06976, pp. 178\u2013192. Springer, Heidelberg (2011)"},{"unstructured":"Genolini, C., Tixeuil, S.: A lower bound on dynamic k-stabilization in asynchronous systems. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), October 13-16. IEEE Computer Society, Osaka (2002)","key":"5_CR6"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/248052.248057","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing","author":"S. Ghosh","year":"1996","unstructured":"Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, May 23-26, pp. 45\u201354. ACM, Philadelphia (1996)"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1073814.1073829","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005","author":"A. Gupta","year":"2005","unstructured":"Gupta, A., Maggs, B.M., Oprea, F., Reiter, M.K.: Quorum placement in networks to minimize access delays. In: Aguilera, M.K., Aspnes, J. (eds.) Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, July 17-20, pp. 87\u201396. ACM, Las Vegas (2005)"},{"doi-asserted-by":"crossref","unstructured":"Kakugawa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: IPDPS (2006)","key":"5_CR9","DOI":"10.1109\/IPDPS.2006.1639550"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-540-92221-6_31","volume-title":"Principles of Distributed Systems","author":"S. Kamei","year":"2008","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing approximation for the minimum connected dominating set with safe convergence. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 496\u2013511. Springer, Heidelberg (2008)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2011.12.007","volume":"428","author":"S. Kamei","year":"2012","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. Theoretical Computer Science\u00a0428, 80\u201390 (2012)","journal-title":"Theoretical Computer Science"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/259380.259435","volume-title":"Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing","author":"S. Kutten","year":"1997","unstructured":"Kutten, S., Patt-Shamir, B.: Time-adaptive self stabilization. In: Burns, J.E., Attiya, H. (eds.) Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, August 21-24, pp. 149\u2013158. ACM, Santa Barbara (1997)"},{"doi-asserted-by":"crossref","unstructured":"Srimani, P.K., Xu, Z.: Distributed protocols for defensive and offensive alliances in network graphs using self-stabilization. In: ICCTA, pp. 27\u201331 (2007)","key":"5_CR13","DOI":"10.1109\/ICCTA.2007.54"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ipl.2007.02.013","volume":"103","author":"V. Turau","year":"2007","unstructured":"Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf. Process. Lett.\u00a0103(3), 88\u201393 (2007)","journal-title":"Inf. Process. Lett."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-34679-8_8","volume-title":"Data and Knowledge Engineering","author":"G. Wang","year":"2012","unstructured":"Wang, G., Wang, H., Tao, X., Zhang, J.: A self-stabilizing algorithm for finding a minimal K-dominating set in general networks. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds.) ICDKE 2012. LNCS, vol.\u00a07696, pp. 74\u201385. Springer, Heidelberg (2012)"}],"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-319-03089-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T11:25:09Z","timestamp":1688556309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}