Optimal sequential gossiping by short messages
From MaRDI portal
Publication:1270817
DOI10.1016/S0166-218X(98)00022-5zbMath0910.90132OpenAlexW2050793667MaRDI QIDQ1270817
Luisa Gargano, Jean-Claude Bermond, Stéphane Pérennes
Publication date: 3 November 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (5)
Optimal gossiping in square 2D meshes ⋮ Concurrent multicast in weighted networks ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Concurrent multicast in weighted networks ⋮ Optimal gossiping in paths and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel and distributed computing. Theory and practice. 1st Canada-France Conference, Montréal, Canada, May 19-21, 1994. Proceedings
- Fast gossiping with short unreliable messages
- Methods and problems of communication in usual networks
- A survey of gossiping and broadcasting in communication networks
- Gossiping in Minimal Time
- Sequential information dissemination by packets
- Fast collective communication by packets in the postal model
- Parallel Information Dissemination by Packets
- Fast gossiping by short messages
- Routing permutations on graphs via matchings
This page was built for publication: Optimal sequential gossiping by short messages
