✦ LIBER ✦

The partial gossiping problem

✍ Scribed by Gerard J. Chang; Yuh-Jiuan Tsay

Book ID: 103060410
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 275 KB
Volume: 148
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00257-j

No coin nor oath required. For personal study only.

✦ Synopsis

This paper studies the following variation of the gossiping problem. Suppose there are n persons, each of whom knows a message. A pair of persons can pass all messages they have by making a telephone call. The partial gossiping problem is to determine the minimum number of calls needed for each person to know at least k messages. This paper gives a complete solution to this problem.

📜 SIMILAR VOLUMES

The exact gossiping problem

✍ Yuh-Jiuan Tsay; Gerard J Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 297 KB

This paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a message. A pair of persons can pass all messages they have by making one telephone call. The exact gossiping problem is to determine the minimum n,,mi~er of calls for each person to know

The gossip problem

✍ Gerald Berman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Further gossip problems

✍ D.J. Kleitman; J.B. Shearer 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 617 KB

n people have distinct bits of information. They can communicate via k-party conference calls. I-Iow many such calls are needed to inform everyone of everyone else's information? Let f(n, k) be this minimum number. Then we give a simple proof that for n>k2. In the 2-party case we consider the case

Note on the problem of gossiping in mult

Note on the problem of gossiping in multidimensional grids

✍ M Mahéo; J.-F Saclé 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Label-connected graphs and the gossip pr

Label-connected graphs and the gossip problem

✍ F. Göbel; J.Orestes Cerdeira; H.J. Veldman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Gobel, F., J. Orestes Cerdeira and H.J. Veldman, Label-connected graphs and the gossip problem, Discrete Mathematics 87 (1991) 29-40. A graph with m edges is called label-connected if the edges can be labeled with real numbers in such a way that, for every pair (u, v) of vertices, there is a (u, v)

Gossip, Gossipers, Gossiping

✍ Fine, G. A.; Rosnow, R. L. 📂 Article 📅 1978 🏛 SAGE Publications 🌐 English ⚖ 920 KB