𝔖 Bobbio Scriptorium
✦   LIBER   ✦

k-Broadcasting in trees

✍ Scribed by Hovhannes A. Harutyunyan; Arthur L. Liestman

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
147 KB
Volume
38
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nonadaptive broadcasting in trees
Nonadaptive broadcasting in trees
✍ Hovhannes A. Harutyunyan; Arthur L. Liestman; Kazuhisa Makino; Thomas C. Shermer πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 210 KB

We study nonadaptive broadcasting in trees, a process of sending a message from one vertex in a tree to all other vertices. In the nonadaptive model, each vertex has a specified, ordered list of its neighbors. After receiving a broadcast message, a vertex sends the message to its neighbors, one afte

Optimal Broadcasting in Faulty Trees
Optimal Broadcasting in Faulty Trees
✍ Petrişor Panaite; Andrzej Pelc πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 291 KB

We consider broadcasting a message from one node of a tree to all other nodes. In the presence of up to k link failures the tree becomes disconnected, and only nodes in the connected component C containing the source can be informed. The maximum ratio between the time used by a broadcasting scheme B

An Optimal Algorithm for Broadcasting Mu
An Optimal Algorithm for Broadcasting Multiple Messages in Trees
✍ Krzysztof Diks; Andrzej Lingas; Andrzej Pelc πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 118 KB

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