{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:40:08Z","timestamp":1748785208363,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268491"},{"type":"electronic","value":"9783319268507"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26850-7_24","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T09:14:46Z","timestamp":1455959686000},"page":"354-366","source":"Crossref","is-referenced-by-count":1,"title":["Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction"],"prefix":"10.1007","author":[{"given":"Colette","family":"Johnen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bein, D., Datta, A.K., Jagganagari, C.R., Villain, V.: A self-stabilizing link-cluster algorithm in mobile Ad Hoc networks. In: International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2005), pp. 436\u2013441 (2005)","DOI":"10.1109\/ISPAN.2005.12"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-22212-2_6","volume-title":"Structural Information and Communication Complexity","author":"A Bui","year":"2011","unstructured":"Bui, A., Clavi\u00e8re, S., Datta, A.K., Larmore, L.L., Sohier, D.: Self-stabilizing hierarchical construction of bounded size clusters. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 54\u201365. Springer, Heidelberg (2011)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jpdc.2010.06.009","volume":"70","author":"E Caron","year":"2010","unstructured":"Caron, E., Datta, A.K., Depardon, B., Larmore, L.L.: Self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distrib. Comput. 70, 1159\u20131173 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1093\/comjnl\/bxn071","volume":"53","author":"AK Datta","year":"2010","unstructured":"Datta, A.K., Larmore, L.L., Vemula, P.: A self-stabilizing O(k)-time k-clustering algorithm. Comput. J. 53(3), 342\u2013350 (2010)","journal-title":"Comput. J."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Larsson, A., Tsigas, P.: A self-stabilizing (k, r)-clustering algorithm with multiple paths for wireless Ad-hoc networks. In: IEEE 31th International Conference on Distributed Computing Systems, (ICDCS 2011), pp. 353\u2013362. IEEE Computer Society (2011)","DOI":"10.1109\/ICDCS.2011.75"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-31104-8_19","volume-title":"Structural Information and Communication Complexity","author":"A Larsson","year":"2012","unstructured":"Larsson, A., Tsigas, P.: Self-stabilizing (k,r)-clustering in clock rate-limited systems. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 219\u2013230. Springer, Heidelberg (2012)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Datta, A., Devismes, S., Larmore, L.: A self-stabilizing $$o(n)$$ o ( n ) -round $$k$$ k -clustering algorithm. In: 28th IEEE Symposium on Reliable Distributed Systems (SRDS 2009), pp. 147\u2013155 (2009)","DOI":"10.1109\/SRDS.2009.13"},{"issue":"1","key":"24_CR8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.15803\/ijnc.3.1_116","volume":"3","author":"AK Datta","year":"2013","unstructured":"Datta, A.K., Larmore, L.L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Self-stabilizing small k-dominating sets. Int. J. Networking Comput. 3(1), 116\u2013136 (2013)","journal-title":"Int. J. Networking Comput."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Datta, A.K., Larmore, L.L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Competitive self-stabilizing k-clustering. In: IEEE 32th International Conference on Distributed Computing (ICDCS 2012), pp. 476\u2013485 (2012)","DOI":"10.1109\/ICDCS.2012.72"},{"issue":"10","key":"24_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.ipl.2014.04.013","volume":"114","author":"C Johnen","year":"2014","unstructured":"Johnen, C.: Fast, silent self-stabilizing distance-k independent dominating set construction. Inf. Process. Lett. 114(10), 551\u2013555 (2014)","journal-title":"Inf. Process. Lett."},{"key":"24_CR11","unstructured":"Johnen, C.: Memory efficient self-stabilizing k-independent dominating set construction. Technical report RR-1473-13, Univ. Bordeaux, LaBRI, UMR 3800, F-33400 Talence, France, June 2013"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26850-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:04:45Z","timestamp":1748783085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26850-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268491","9783319268507"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26850-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}