Reordered gossip schemes
From MaRDI portal
Publication:1923510
DOI10.1016/0012-365X(94)00302-YzbMath0861.68065MaRDI QIDQ1923510
Publication date: 7 October 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Label-connected graphs and the gossip problem
- Further gossip problems
- The communication problem on graphs
- Gossips and telegraphs
- Kernels of minimum size gossip schemes
- Information flows on hypergraphs
- Gossips and telephones
- The Communication Complexity of Atomic Commitment and of Gossiping
- A survey of gossiping and broadcasting in communication networks
- A Problem with Telephones
- Gossiping in Minimal Time
- A Cure for the Telephone Disease