{"title":"Multi-node broadcasting in hypercubes and star graphs","authors":"Y. Tseng","doi":"10.1109/ICAPP.1997.651479","DOIUrl":null,"url":null,"abstract":"In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.","PeriodicalId":325978,"journal":{"name":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1997.651479","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
