Broadcasting in Trees with Multiple Originators
| dc.contributor.author | Farley, Arthur M. | |
| dc.contributor.author | Proskurowski, Andrzej | |
| dc.date.accessioned | 2023-06-28T21:17:07Z | |
| dc.date.available | 2023-06-28T21:17:07Z | |
| dc.date.issued | 1980 | |
| dc.description | 13 pages | en_US |
| dc.description.abstract | Broadcasting is the information dissemination process in a communication network whereby all sites of the network become informed of a given message by calls made over lines of the network. We present an algorithm which, given a tree network and a time, determines a smallest set of subtrees covering sites of the network such that broadcast can be completed within the given time in each subtree. Information developed by the algorithm is sufficient to determine a satisfactory originator and calling scheme within each subtree. | en_US |
| dc.identifier.citation | Farley, A. M., & Proskurowski, A. (1980). Broadcasting in Trees with Multiple Originators. SIAM Journal on Algebraic Discrete Methods, 2(4), 381—386. https://doi.org/10.1137/0602040 | en_US |
| dc.identifier.doi | https://doi.org/10.1137/0602040 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/28457 | |
| dc.identifier.uri | https://epubs.siam.org/doi/10.1137/0602040 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Oregon | en_US |
| dc.rights | Creative Commons BY-NC-ND 4.0-US | en_US |
| dc.subject | Garey and Johnson | en_US |
| dc.subject | level-based network | en_US |
| dc.subject | communication characteristics | en_US |
| dc.title | Broadcasting in Trees with Multiple Originators | en_US |
| dc.type | Article | en_US |