A study of minimum gossip graphs

DOI10.1016/S0012-365X(99)00227-7MaRDI QIDQ1974518zbMATH OpenFDO

Authors Guillaume Fertin

Publication date 7 May 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)00227-7

zbMATH Keywords

communication problemsgossipinginformation disseminationminimum gossip graphsnetworks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1262788
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Cyclic gossiping times for some classes of graphs
• Broadcast and gossip in line-communication mode

Cited in

(14)

• Minimum broadcast tree decompositions
• Note on optimal gossiping in some weak-connected graphs
• A survey on Knödel graphs.
• Hierarchical broadcast and gossip networks
• The epistemic gossip problem
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• A survey of gossiping and broadcasting in communication networks
• scientific article; zbMATH DE number 1262788 (Why is no real title available?)
• scientific article; zbMATH DE number 1538541 (Why is no real title available?)
• Minimum gossip bus networks
• Gossiping and set-to-set broadcasting in weighted graphs
• Some minimum gossip graphs
• On generalized gossiping and broadcasting
• Cyclic gossiping times for some classes of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974518)