The communication problem on graphs
From MaRDI portal
Publication:1217715
DOI10.1016/0016-0032(74)90126-4zbMath0307.05118MaRDI QIDQ1217715
Frank Harary, Allen J. Schwenk
Publication date: 1974
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(74)90126-4
Related Items
Toward optimal gossiping schemes with conference calls, A class of solutions to the gossip problem. III, 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, Gossips and telegraphs, Communication complexity of fault-tolerant information diffusion, Kernels of minimum size gossip schemes, The partial gossiping problem, Reordered gossip schemes, Telephone Problems with Failures, A Problem with Telephones
Cites Work