Quick gossiping without duplicate transmissions
From MaRDI portal
There are n people, each knowing a gossip. They communicate by phone calls, and whenever two persons talk they tell all information they know at that time. Denote by f(n) the minimal number of necessary calls when everybody hears each gossip exactly once. We prove that \[ f(n)=2.25n-6\;if\;n=4k,\quad k\geq 2\quad and \] \[ 2.25n-4.5\leq f(n)\leq 2.25n-3.5\;if\;n=4k+2,\quad k\geq 5. \] (If n is odd, or \(n=4k+2\), \(0<k<5\) then there are no appropriate sequences of calls at all.)
Recommendations
Cites work
- A class of solutions to the gossip problem. I
- A class of solutions to the gossip problem. III
- A Cure for the Telephone Disease
- A Problem with Telephones
- Efficient Communication by Phone Calls
- Further gossip problems
- Gossiping old ladies
- Gossiping without Duplicate Transmissions
- Gossips and telephones
- scientific article; zbMATH DE number 3849231 (Why is no real title available?)
- scientific article; zbMATH DE number 3358479 (Why is no real title available?)
- The communication problem on graphs
Cited in
(14)- The addition game: An abstraction of a communication problem
- Set to set broadcasting in communication networks
- Quick gossiping by telegraphs
- The exact gossiping problem
- Asymptotically optimal gossiping in radio networks
- Gossiping with multiple sends and receives
- The logic of gossiping
- Quick Gossiping by Conference Calls
- scientific article; zbMATH DE number 15364 (Why is no real title available?)
- Gossiping in Minimal Time
- Fast Gossiping by Short Messages
- scientific article; zbMATH DE number 7440211 (Why is no real title available?)
- scientific article; zbMATH DE number 4189783 (Why is no real title available?)
- A class of solutions to the gossip problem. III
This page was built for publication: Quick gossiping without duplicate transmissions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080864)
