Odd gossiping

DOI10.1016/j.dam.2016.01.034zbMath1372.68028OpenAlexW2914186449MaRDI QIDQ516782

Guillaume Fertin, Lynette Raabe, Charlie Xu, Joseph G. Peters

Publication date: 15 March 2017

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

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

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)

Related Items (2)

Optimal odd gossiping ⋮ A survey on Knödel graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal instances for the original syntenic distance
• 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
• The Worst Case Behavior of Randomized Gossip
• Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time

This page was built for publication: Odd gossiping