Parallel algorithms for gossiping by mail

DOI10.1016/0020-0190(90)90160-YzbMath0696.68048MaRDI QIDQ911271

S. Louis Hakimi, John Mitchem, Anindo Bagchi, Edward F. Schmeichel

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsgossipingone-way communication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (10)

Optimal algorithms for dissemination of information in generalized communication modes ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ On the number of broadcast schemes in networks ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ Gossiping with multiple sends and receives ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Fast gossiping on square mesh computers ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item
• New gossips and telephones
• Gossips and telegraphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• A data structure for manipulating priority queues

This page was built for publication: Parallel algorithms for gossiping by mail