Optimal gossiping in paths and cycles
From MaRDI portal
Publication:1827271
DOI10.1016/S1570-8667(03)00038-8zbMath1077.68120MaRDI QIDQ1827271
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Optimal sequential gossiping by short messages
- Fast gossiping on square mesh computers
- Methods and problems of communication in usual networks
- A survey of gossiping and broadcasting in communication networks
- Gossiping in Minimal Time
- Fast Gossiping for the Hypercube
- Sequential information dissemination by packets
- Fast Gossiping by Short Messages
- Time and Cost Trade-Offs in Gossiping
- Parallel Information Dissemination by Packets