{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:44:53Z","timestamp":1743104693671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_37","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"485-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Broadcasting in\u00a0Stars of\u00a0Cliques"],"prefix":"10.1007","author":[{"given":"Akash","family":"Ambashankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"37_CR1","unstructured":"Bermond, J.C.: Graceful graphs, radio antennae and French windmills. In: Proceedings One day Combinatorics Conference, Research Notes in Mathematics, vol. 34, pp. 18\u201337. Pitman (1979)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Bhabak, P., Harutyunyan, H.A., Tanna, S.: Broadcasting in Harary-like graphs. In: 2014 IEEE 17th International Conference on Computational Science and Engineering, pp. 1269\u20131276. IEEE (2014)","DOI":"10.1109\/CSE.2014.244"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s10878-015-9957-8","volume":"33","author":"M \u010cevnik","year":"2017","unstructured":"\u010cevnik, M., \u017derovnik, J.: Broadcasting on cactus graphs. J. Comb. Optim. 33, 292\u2013316 (2017)","journal-title":"J. Comb. Optim."},{"key":"37_CR4","unstructured":"Dinneen, M.J.: The complexity of broadcasting in bounded-degree networks. arXiv preprint math\/9411222 (1994)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 438\u2013447 (2002)","DOI":"10.1145\/509907.509972"},{"key":"37_CR6","first-page":"215","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., R\u00e9nyi, A., S\u00f3s, V.: On a problem of graph theory, studia sci. Math. Hungar. 1, 215\u2013235 (1966)","journal-title":"Math. Hungar."},{"key":"37_CR7","unstructured":"Farley, A.M., Hedetniemi, S.T.: Broadcasting in grid graphs. In: Proceedings of the 9th SE Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, pp. 275\u2013288 (1978)"},{"issue":"1\u20133","key":"37_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discret. Appl. Math. 53(1\u20133), 79\u2013133 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"01","key":"37_CR9","doi-asserted-by":"publisher","first-page":"2150037","DOI":"10.1142\/S0219265921500377","volume":"23","author":"S Gholami","year":"2023","unstructured":"Gholami, S., Harutyunyan, H.A., Maraachlian, E.: Optimal broadcasting in fully connected trees. J. Interconnection Netw. 23(01), 2150037 (2023)","journal-title":"J. Interconnection Netw."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., Hovhannisyan, N., Maraachlian, E.: Broadcasting in chains of rings. In: 2023 Fourteenth International Conference on Ubiquitous and Future Networks (ICUFN), pp. 506\u2013511. IEEE (2023)","DOI":"10.1109\/ICUFN57995.2023.10201234"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., Liestman, A.L., Peters, J.G., Richards, D.: Broadcasting and gossiping. In: Handbook of Graph Theory, pp. 1477\u20131494 (2013)","DOI":"10.1201\/b16132-87"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-73545-8_37","volume-title":"Computing and Combinatorics","author":"H Harutyunyan","year":"2007","unstructured":"Harutyunyan, H., Maraachlian, E.: Linear algorithm for broadcasting in unicyclic graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 372\u2013382. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73545-8_37"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10878-008-9160-2","volume":"16","author":"HA Harutyunyan","year":"2008","unstructured":"Harutyunyan, H.A., Maraachlian, E.: On broadcasting in unicyclic graphs. J. Comb. Optim. 16, 307\u2013322 (2008)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319\u2013349 (1988)","journal-title":"Networks"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BFb0029627","volume-title":"Mathematical Foundations of Computer Science 1990","author":"J Hromkovi\u010d","year":"1990","unstructured":"Hromkovi\u010d, J., Jeschke, C.-D., Monien, B.: Optimal algorithms for dissemination of information in some interconnection networks. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 337\u2013346. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0029627"},{"issue":"1\u20133","key":"37_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0166-218X(97)00110-8","volume":"83","author":"A Jakoby","year":"1998","unstructured":"Jakoby, A., Reischuk, R., Schindelhauer, C.: The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. 83(1\u20133), 179\u2013206 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"37_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"AL Liestman","year":"1988","unstructured":"Liestman, A.L., Peters, J.G.: Broadcast networks of bounded degree. SIAM J. Discret. Math. 1(4), 531\u2013540 (1988)","journal-title":"SIAM J. Discret. Math."},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Middendorf, M.: Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2, vol.\u00a046, pp. 281\u2013287. Elsevier (1993)","DOI":"10.1016\/0020-0190(93)90066-I"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Schindelhauer, C.: On the inapproximability of broadcasting time. In: Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 226\u2013237 (2000)","DOI":"10.1007\/3-540-44436-X_23"},{"issue":"4","key":"37_CR20","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692\u2013701 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:18:41Z","timestamp":1718975921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}