Further gossip problems

DOI10.1016/0012-365X(80)90116-8MaRDI QIDQ1144577zbMATH OpenOpenAlexFDO

Authors Daniel J. Kleitman, James B. Shearer

Publication date 1980

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(80)90116-8

zbMATH Keywords

gossip problemstelephone problems

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Cites work

• A Problem with Telephones
• Efficient Communication by Phone Calls
• Gossips and telephones

Cited in

(21)

• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Verifiable broadcasting and gossiping in communication networks
• The epistemic gossip problem
• Communication complexity of fault-tolerant information diffusion
• Gossip Latin square and the meet-all gossipers problem
• Asymptotically optimal gossiping in radio networks
• Kernels of minimum size gossip schemes
• Reordered gossip schemes
• A Problem with Telephones
• Gossiping without Duplicate Transmissions
• Graph theoretical issues in computer networks
• Toward optimal gossiping schemes with conference calls
• The number of rounds needed to exchange information within a graph
• Information flows on hypergraphs
• The partial gossiping problem
• Set to set broadcasting in communication networks
• Telephone Problems with Failures
• Label-connected graphs and the gossip problem
• A class of solutions to the gossip problem. I
• Broadcasting on \([0,L]\)
• Quick gossiping without duplicate transmissions

This page was built for publication: Further gossip problems

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