Sequential information dissemination by packets
From MaRDI portal
Publication:4018992
DOI10.1002/net.3230220402zbMath0752.94021OpenAlexW2062421867MaRDI QIDQ4018992
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi
Publication date: 16 January 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220402
Related Items
On the communication complexity of polling ⋮ Optimal gossiping in square 2D meshes ⋮ Fast gossiping by short messages ⋮ Communication complexity of gossiping by packets ⋮ Optimal sequential gossiping by short messages ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Optimal gossiping in paths and cycles ⋮ ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
Cites Work