Efficient Communication by Phone Calls
From MaRDI portal
Cites work
Cited in
(8)- The number of rounds needed to exchange information within a graph
- Quick gossiping without duplicate transmissions
- Further gossip problems
- A class of solutions to the gossip problem. I
- Gossips and telegraphs
- Information flows on hypergraphs
- A survey of gossiping and broadcasting in communication networks
- Toward optimal gossiping schemes with conference calls
This page was built for publication: Efficient Communication by Phone Calls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050597)