An algorithm for constructing minimal c-broadcast networks
✍ Scribed by Shiwoo Lee; José A. Ventura
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 265 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0028-3045
- DOI
- 10.1002/net.1019
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The groupings of taxa in a phylogenetic tree cannot represent all the conflicting signals that usually occur among site patterns in aligned homologous genetic sequences. Hence a tree-building program must compromise by reporting a subset of the patterns, using some discriminatory criterion. Thus, in
We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting