Further gossip problems
From MaRDI portal
Publication:1144577
DOI10.1016/0012-365X(80)90116-8zbMath0444.05015MaRDI QIDQ1144577
Daniel J. Kleitman, James B. Shearer
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
05A99: Enumerative combinatorics
Related Items
Toward optimal gossiping schemes with conference calls, Label-connected graphs and the gossip problem, The number of rounds needed to exchange information within a graph, Quick gossiping without duplicate transmissions, A class of solutions to the gossip problem. I, Set to set broadcasting in communication networks, Communication complexity of fault-tolerant information diffusion, Graph theoretical issues in computer networks, Broadcasting on \([0,L\)], Verifiable broadcasting and gossiping in communication networks, Asymptotically optimal gossiping in radio networks, Kernels of minimum size gossip schemes, The partial gossiping problem, Reordered gossip schemes, Information flows on hypergraphs, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, Telephone Problems with Failures, Gossiping without Duplicate Transmissions, A Problem with Telephones
Cites Work