{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:10:16Z","timestamp":1753884616799,"version":"3.41.2"},"reference-count":28,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p> Broadcasting is disseminating information in a network where a specific message must spread to all network vertices as quickly as possible. Finding the minimum broadcast time of a vertex in an arbitrary network is proven to be NP-complete. However, this problem is solvable for a few families of networks. In this paper, we present an optimal algorithm for finding the broadcast time of any vertex in a fully connected tree ([Formula: see text]) in [Formula: see text] time. An [Formula: see text] is formed by attaching arbitrary trees to vertices of a complete graph of size [Formula: see text] where [Formula: see text] is the total number of vertices in the graph. <\/jats:p>","DOI":"10.1142\/s0219265921500377","type":"journal-article","created":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T04:55:52Z","timestamp":1659761752000},"source":"Crossref","is-referenced-by-count":13,"title":["Optimal Broadcasting in Fully Connected Trees"],"prefix":"10.1142","volume":"23","author":[{"given":"Saber","family":"Gholami","sequence":"first","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada H3G 1M8, Canada"}]},{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada H3G 1M8, Canada"}]},{"given":"Edward","family":"Maraachlian","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada H3G 1M8, Canada"}]}],"member":"219","published-online":{"date-parts":[[2022,8,5]]},"reference":[{"key":"S0219265921500377BIB001","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<293::AID-NET4>3.0.CO;2-B"},{"key":"S0219265921500377BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2694-0_2"},{"key":"S0219265921500377BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/net.21945"},{"key":"S0219265921500377BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/net.21749"},{"key":"S0219265921500377BIB005","first-page":"17","volume-title":"Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":"Beier R.","year":"2000"},{"key":"S0219265921500377BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265903000726"},{"key":"S0219265921500377BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/net.10088"},{"key":"S0219265921500377BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028579"},{"key":"S0219265921500377BIB010","first-page":"76","volume-title":"SODA","volume":"3","author":"Elkin M.","year":"2003"},{"key":"S0219265921500377BIB011","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704440740"},{"key":"S0219265921500377BIB012","doi-asserted-by":"publisher","DOI":"10.1002\/net.10104"},{"key":"S0219265921500377BIB013","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1318"},{"key":"S0219265921500377BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000049"},{"key":"S0219265921500377BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC51732.2021.9375923"},{"key":"S0219265921500377BIB016","first-page":"157","volume-title":"7th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":"Harutyunyan H. A.","year":"2000"},{"key":"S0219265921500377BIB017","doi-asserted-by":"publisher","DOI":"10.1002\/net.20110"},{"key":"S0219265921500377BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2014.63"},{"key":"S0219265921500377BIB019","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6"},{"key":"S0219265921500377BIB020","doi-asserted-by":"publisher","DOI":"10.1002\/net.1034"},{"key":"S0219265921500377BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73545-8_37"},{"key":"S0219265921500377BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9160-2"},{"key":"S0219265921500377BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2009.48"},{"key":"S0219265921500377BIB024","first-page":"296","volume-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA)","author":"Harutyunyan H. A.","year":"2009"},{"key":"S0219265921500377BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00110-8"},{"key":"S0219265921500377BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90066-I"},{"key":"S0219265921500377BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365693"},{"issue":"9","key":"S0219265921500377BIB029","first-page":"804","volume":"33","author":"Scheuermann P.","year":"1984","journal-title":"IEEE Computer Architecture Letters"},{"key":"S0219265921500377BIB030","doi-asserted-by":"publisher","DOI":"10.1137\/0210052"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921500377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T04:18:36Z","timestamp":1668572316000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265921500377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,5]]},"references-count":28,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1142\/S0219265921500377"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921500377","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2022,8,5]]},"article-number":"2150037"}}