The following pages link to Further gossip problems (Q1144577):
Displaying 21 items.
- Toward optimal gossiping schemes with conference calls (Q787168) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← links)
- The number of rounds needed to exchange information within a graph (Q1054746) (← links)
- Quick gossiping without duplicate transmissions (Q1080864) (← links)
- A class of solutions to the gossip problem. I (Q1170198) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Broadcasting on \([0,L]\) (Q1339897) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- Asymptotically optimal gossiping in radio networks (Q1897368) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- Gossip Latin square and the meet-all gossipers problem (Q2348701) (← links)
- Information flows on hypergraphs (Q2366011) (← links)
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs (Q2764998) (← links)
- Telephone Problems with Failures (Q3699732) (← links)
- Gossiping without Duplicate Transmissions (Q3960730) (← links)
- A Problem with Telephones (Q3964600) (← links)
