Gossiping with multiple sends and receives

DOI10.1016/0166-218X(95)00123-9zbMath0863.90063MaRDI QIDQ1917243

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

Publication date: 20 May 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

hypercubegossipinggridtoroidal gridsnetworks of processorswrap-arounddissemination of information

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Parallel algorithms for gossiping by mail
• Fast information sharing in a complete network
• Gossips and telegraphs
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube

This page was built for publication: Gossiping with multiple sends and receives