{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:54:55Z","timestamp":1761976495334,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":11,"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_18","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"251-265","source":"Crossref","is-referenced-by-count":5,"title":["An Asynchronous Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Sayaka","family":"Kamei","sequence":"first","affiliation":[]},{"given":"Tomoko","family":"Izumi","sequence":"additional","affiliation":[]},{"given":"Yukiko","family":"Yamauchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086(1-3), 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"issue":"11","key":"18_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. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Kakuagwa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: Proceedings of the 8th IPDPS Workshop on Advances in Parallel and Distributed Computational Model, p. 263 (2006)","DOI":"10.1109\/IPDPS.2006.1639550"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Jain, A., Gupta, A.: A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 615\u2013619 (2005)","DOI":"10.1109\/PDCAT.2005.10"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/11945529_30","volume-title":"Principles of Distributed Systems","author":"V. Drabkin","year":"2006","unstructured":"Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlays. In: Shvartsman, A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 425\u2013439. Springer, Heidelberg (2006)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS Workshop on Advances in Parallel and Distributed Computational Models, p. 224 (2007)","DOI":"10.1109\/IPDPS.2007.370464"},{"key":"18_CR7","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 graph. Theoretical Computer Science\u00a0428, 80\u201390 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/71.888644","volume":"11","author":"T. Herman","year":"2000","unstructured":"Herman, T.: Phase clocks for transient fault repair. IEEE Transactions on Parallel and Distributed Systems\u00a011(10), 1048\u20131057 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"18_CR9","unstructured":"Berge, C.: Theory of Graphs and its Applications. Methuen (1962)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-25873-2_12","volume-title":"Principles of Distributed Systems","author":"A. Cournier","year":"2011","unstructured":"Cournier, A., Rovedakis, S., Villain, V.: The first fully polynomial stabilizing algorithm for bfs tree construction. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 159\u2013174. Springer, Heidelberg (2011)"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P.J. Wan","year":"2004","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications\u00a09(2), 141\u2013149 (2004)","journal-title":"Mobile Networks and Applications"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:25:54Z","timestamp":1746033954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}