Parallel algorithms for gossiping by mail
From MaRDI portal
Publication:911271
DOI10.1016/0020-0190(90)90160-YzbMath0696.68048MaRDI QIDQ911271
S. Louis Hakimi, Edward F. Schmeichel, Anindo Bagchi, John Mitchem
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68N25: Theory of operating systems
Related Items
The complexity of systolic dissemination of information in interconnection networks, On the number of broadcast schemes in networks, Optimal algorithms for dissemination of information in some interconnection networks, Fast gossiping on square mesh computers, Graph theoretical issues in computer networks, Optimal algorithms for dissemination of information in generalized communication modes, Note on optimal gossiping in some weak-connected graphs, Optimal algorithms for broadcast and gossip in the edge-disjoint modes, Gossiping with multiple sends and receives
Cites Work