Optimal odd gossiping

DOI10.1016/j.dam.2018.03.033zbMath1423.68047OpenAlexW2795589868MaRDI QIDQ1671312

Joseph G. Peters, Guillaume Fertin

Publication date: 6 September 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.033

zbMATH Keywords

communication networksgossipinginformation dissemination

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)

Cites Work

• Unnamed Item
• Odd gossiping
• New gossips and telephones
• Methods and problems of communication in usual networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time