{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:17:48Z","timestamp":1753881468022,"version":"3.41.2"},"reference-count":54,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p> Broadcasting is a fundamental problem in the information dissemination area. In classical broadcasting, a message must be sent from one network member to all other members as rapidly as feasible. Although it has been demonstrated that this problem is NP-Hard for arbitrary graphs, it has several applications in various fields. As a result, the universal lists model, replicating real-world restrictions like the memory limits of nodes in large networks, is introduced as a branch of this problem in the literature. In the universal lists model, each node is equipped with a fixed list and has to follow the list regardless of the originator. <\/jats:p><jats:p> In this study, we focus on the non-adaptive branch of universal lists broadcasting. In this regard, we establish the optimal broadcast time of [Formula: see text]-ary trees and binomial trees under the non-adaptive model and provide an upper bound for complete bipartite graphs. We also improved a general upper bound for trees under the same model and showed that our upper bound cannot be improved in general. <\/jats:p>","DOI":"10.1142\/s0129626423400170","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T13:46:45Z","timestamp":1709041605000},"source":"Crossref","is-referenced-by-count":2,"title":["A Note to Non-adaptive Broadcasting"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6275-3388","authenticated-orcid":false,"given":"Saber","family":"Gholami","sequence":"first","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, H3G 1M8, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7260-4186","authenticated-orcid":false,"given":"Hovhannes A.","family":"Harutyunyan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, H3G 1M8, Canada"}]}],"member":"219","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"S0129626423400170BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2017.16"},{"key":"S0129626423400170BIB002","doi-asserted-by":"publisher","DOI":"10.23919\/JCN.2021.000011"},{"key":"S0129626423400170BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.11.007"},{"key":"S0129626423400170BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_51"},{"key":"S0129626423400170BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360253"},{"volume-title":"Malware Diffusion Models for Modern Complex Networks: Theory and Applications","year":"2016","author":"Karyotis V.","key":"S0129626423400170BIB006"},{"key":"S0129626423400170BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/12.46277"},{"key":"S0129626423400170BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/71.342123"},{"key":"S0129626423400170BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<183::AID-NET3>3.0.CO;2-E"},{"key":"S0129626423400170BIB010","first-page":"29","volume-title":"Complex Networks XIII: Proceedings of the 13th Conference on Complex Networks (CompleNet\u200a)","author":"Gholami S.","year":"2023"},{"key":"S0129626423400170BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2021.3099728"},{"key":"S0129626423400170BIB012","doi-asserted-by":"publisher","DOI":"10.23919\/JCN.2021.000004"},{"key":"S0129626423400170BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-6125-y"},{"key":"S0129626423400170BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC57785.2022.00024"},{"key":"S0129626423400170BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2013.6553676"},{"key":"S0129626423400170BIB016","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"S0129626423400170BIB017","first-page":"1477","volume-title":"Handbook of Graph Theory","author":"Harutyunyan H. A.","year":"2013"},{"volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","year":"1983","author":"Garey M. R.","key":"S0129626423400170BIB018"},{"key":"S0129626423400170BIB019","doi-asserted-by":"publisher","DOI":"10.1137\/0210052"},{"key":"S0129626423400170BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00110-8"},{"key":"S0129626423400170BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90066-I"},{"key":"S0129626423400170BIB023","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704440740"},{"key":"S0129626423400170BIB024","first-page":"275","volume-title":"Proceedings 9th S.E. Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica","author":"Farley A. M.","year":"1978"},{"key":"S0129626423400170BIB025","doi-asserted-by":"publisher","DOI":"10.1137\/0401049"},{"key":"S0129626423400170BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908630"},{"key":"S0129626423400170BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9160-2"},{"key":"S0129626423400170BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73545-8_37"},{"key":"S0129626423400170BIB029","first-page":"296","volume-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\u200a)","author":"Harutyunyan H. A.","year":"2009"},{"key":"S0129626423400170BIB030","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265921500377"},{"key":"S0129626423400170BIB031","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480193245923"},{"key":"S0129626423400170BIB032","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365693"},{"key":"S0129626423400170BIB033","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276857"},{"key":"S0129626423400170BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.12.002"},{"key":"S0129626423400170BIB035","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265919500063"},{"key":"S0129626423400170BIB036","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14974-5_3"},{"key":"S0129626423400170BIB037","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-95018-7_24"},{"key":"S0129626423400170BIB038","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2017.34"},{"key":"S0129626423400170BIB039","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2014.244"},{"key":"S0129626423400170BIB040","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC51732.2021.9375923"},{"key":"S0129626423400170BIB041","first-page":"17","volume-title":"Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO\u200a)","author":"Beier R.","year":"2000"},{"key":"S0129626423400170BIB042","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.06.010"},{"key":"S0129626423400170BIB043","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2010.110"},{"key":"S0129626423400170BIB044","doi-asserted-by":"publisher","DOI":"10.1002\/net.21945"},{"key":"S0129626423400170BIB045","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1318"},{"key":"S0129626423400170BIB046","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000049"},{"key":"S0129626423400170BIB047","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2014.63"},{"issue":"9","key":"S0129626423400170BIB048","first-page":"804","volume":"33","author":"Scheuermann P.","year":"1984","journal-title":"IEEE Computer Architecture Letters"},{"key":"S0129626423400170BIB049","doi-asserted-by":"publisher","DOI":"10.1002\/net.20068"},{"key":"S0129626423400170BIB050","first-page":"641","volume-title":"Proceedings of the 25th Allerton Conference on Communication, Control and Computing","author":"Rosenthal A.","year":"1987"},{"key":"S0129626423400170BIB051","first-page":"370","volume-title":"Proceedings Eighth International Conference on Information Visualisation","author":"Harutyunyan H. A.","year":"2004"},{"key":"S0129626423400170BIB052","doi-asserted-by":"publisher","DOI":"10.1002\/net.20396"},{"key":"S0129626423400170BIB053","doi-asserted-by":"publisher","DOI":"10.23919\/JCN.2022.000051"},{"key":"S0129626423400170BIB054","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.99.032301"},{"key":"S0129626423400170BIB055","first-page":"885","volume-title":"The International Conference on Cyber Security Intelligence and Analytics","author":"Li M.-S.","year":"2019"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626423400170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T13:47:32Z","timestamp":1709041652000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626423400170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":54,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1142\/S0129626423400170"],"URL":"https:\/\/doi.org\/10.1142\/s0129626423400170","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"article-number":"2340017"}}