{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:45:19Z","timestamp":1743155119743,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030948757"},{"type":"electronic","value":"9783030948764"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94876-4_5","type":"book-chapter","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T08:20:02Z","timestamp":1642494002000},"page":"79-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Distributed Algorithm for Constructing an Independent Dominating Set"],"prefix":"10.1007","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Dogra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anurag Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhasis","family":"Bhattacharjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"5_CR1","unstructured":"Bhattacharjee, S., Dattagupta, J., Srimani, P.K.: An efficient coordinated scheme of constructing connected dominating set in adhoc and sensor networks. In: Proceedings of the International Conference on Advanced Computing and Communications, pp. 402\u2013411. IEEE (2004)"},{"key":"5_CR2","unstructured":"Bhattacharjee, S.: Distributed algorithms for initialization and topology control in wireless ad hoc networks. Ph.D. thesis, Indian Statistical Institute, Kolkata (2010)"},{"issue":"4\u20135","key":"5_CR3","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4\u20135), 558\u2013572 (2013)","journal-title":"Discret. Appl. Math."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-13284-1_20","volume-title":"Structural Information and Communication Complexity","author":"N Bourgeois","year":"2010","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 247\u2013261. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13284-1_20"},{"key":"5_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2016","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2016)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11917496_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Gaspers","year":"2006","unstructured":"Gaspers, S., Liedloff, M.: A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 78\u201389. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_8"},{"issue":"7","key":"5_CR8","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","volume":"313","author":"W Goddard","year":"2013","unstructured":"Goddard, W., Henning, M.A.: Independent domination in graphs: a survey and recent results. Discret. Math. 313(7), 839\u2013854 (2013)","journal-title":"Discret. Math."},{"key":"5_CR9","unstructured":"Haraguchi, K.: An efficient local search for the minimum independent dominating set problem. arXiv preprint arXiv:1802.06478 (2018)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ipl.2008.09.021","volume":"109","author":"JL Hurink","year":"2008","unstructured":"Hurink, J.L., Nieberg, T.: Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. 109(2), 155\u2013160 (2008)","journal-title":"Inf. Process. Lett."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (TKDD) 1(1), 2-es (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.09.001","volume":"562","author":"CH Liu","year":"2015","unstructured":"Liu, C.H., Poon, S.H., Lin, J.Y.: Independent dominating set problem revisited. Theoret. Comput. Sci. 562, 1\u201322 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1134\/S1990478920020131","volume":"14","author":"YA Loverov","year":"2020","unstructured":"Loverov, Y.A., Orlovich, Y.L.: NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs. J. Appl. Ind. Math. 14(2), 353\u2013368 (2020)","journal-title":"J. Appl. Ind. Math."},{"key":"5_CR14","unstructured":"McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, vol. 2012, pp. 548\u201356. Citeseer (2012)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Davies, R., Sarkar, R., Sutton, C.: GEMSEC: graph embedding with self clustering. In: Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2019, pp. 65\u201372. ACM (2019)","DOI":"10.1145\/3341161.3342890"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM 2020), pp. 1325\u20131334. ACM (2020)","DOI":"10.1145\/3340531.3411866"},{"issue":"8","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1007\/s00521-016-2813-7","volume":"30","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Chen, J., Sun, H., Yin, M.: A memetic algorithm for minimum independent dominating set problem. Neural Comput. Appl. 30(8), 2519\u20132529 (2018)","journal-title":"Neural Comput. Appl."},{"key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105949","volume":"88","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Li, C., Yin, M.: A two phase removing algorithm for minimum independent dominating set problem. Appl. Soft Comput. 88, 105949 (2020)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94876-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T10:22:20Z","timestamp":1674469340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94876-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030948757","9783030948764"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94876-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Additionally, 4 invited papers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}