Further gossip problems
From MaRDI portal
Publication:1144577
DOI10.1016/0012-365X(80)90116-8zbMath0444.05015OpenAlexW2068142244MaRDI QIDQ1144577
James B. Shearer, Daniel J. Kleitman
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
Related Items
Gossiping without Duplicate Transmissions ⋮ Telephone Problems with Failures ⋮ A Problem with Telephones ⋮ Quick gossiping without duplicate transmissions ⋮ Information flows on hypergraphs ⋮ Broadcasting on \([0,L\)] ⋮ Asymptotically optimal gossiping in radio networks ⋮ Kernels of minimum size gossip schemes ⋮ The partial gossiping problem ⋮ Reordered gossip schemes ⋮ The epistemic gossip problem ⋮ A class of solutions to the gossip problem. I ⋮ Set to set broadcasting in communication networks ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Toward optimal gossiping schemes with conference calls ⋮ The number of rounds needed to exchange information within a graph ⋮ Label-connected graphs and the gossip problem ⋮ Gossip Latin square and the meet-all gossipers problem ⋮ Verifiable broadcasting and gossiping in communication networks ⋮ Graph theoretical issues in computer networks
Cites Work
