Fast Gossiping by Short Messages
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (4) , 917-941
- https://doi.org/10.1137/s0097539795283619
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Efficient Gossiping by Packets in Networks with Random FaultsSIAM Journal on Discrete Mathematics, 1996
- Antepenultimate broadcastingNetworks, 1995
- Approximation Algorithms for Minimum-Time BroadcastSIAM Journal on Discrete Mathematics, 1995
- Routing Permutations on Graphs via MatchingsSIAM Journal on Discrete Mathematics, 1994
- Parallel Information Dissemination by PacketsSIAM Journal on Computing, 1994
- Sequential information dissemination by packetsNetworks, 1992
- Fast Gossiping for the HypercubeSIAM Journal on Computing, 1992
- Tight Bounds on Mimimum Broadcast NetworksSIAM Journal on Discrete Mathematics, 1991
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- The classification of hamiltonian generalized Petersen graphsJournal of Combinatorial Theory, Series B, 1983