A Problem with Telephones
From MaRDI portal
Publication:3964600
DOI10.1137/0602002zbMath0499.05034OpenAlexW2055587470MaRDI QIDQ3964600
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602002
Related Items
Gossiping without Duplicate Transmissions ⋮ Telephone Problems with Failures ⋮ Quick gossiping without duplicate transmissions ⋮ Information flows on hypergraphs ⋮ Propositional gossip protocols ⋮ Kernels of minimum size gossip schemes ⋮ Better bounds for perpetual gossiping ⋮ The partial gossiping problem ⋮ Reordered gossip schemes ⋮ Dynamic gossip ⋮ Further gossip problems ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Minimal number of calls in propositional protocols ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ The epistemic gossip problem ⋮ A class of solutions to the gossip problem. I ⋮ Connectivity and inference problems for temporal networks ⋮ On Gossiping with Faulty Telephone Lines ⋮ Set to set broadcasting in communication networks ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Broadcasting in weighted trees under the postal model ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ Toward optimal gossiping schemes with conference calls ⋮ A class of solutions to the gossip problem. III ⋮ Gossiping old ladies ⋮ The number of rounds needed to exchange information within a graph ⋮ Label-connected graphs and the gossip problem ⋮ Lossy gossip and composition of metrics ⋮ Graph theoretical issues in computer networks
Cites Work
