A study of minimum gossip graphs

DOI10.1016/S0012-365X(99)00227-7zbMath0983.94002MaRDI QIDQ1974518

Guillaume Fertin

Publication date: 7 May 2000

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

zbMATH Keywords

networksgossipinginformation disseminationcommunication problemsminimum gossip graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication theory (94A05)

Related Items (5)

The epistemic gossip problem ⋮ A survey on Knödel graphs. ⋮ Unnamed Item ⋮ Minimum broadcast tree decompositions ⋮ Hierarchical broadcast and gossip networks

This page was built for publication: A study of minimum gossip graphs