A Cure for the Telephone Disease
From MaRDI portal
Publication:5663914
DOI10.4153/CMB-1972-081-0zbMath0251.05132MaRDI QIDQ5663914
Endre Szemerédi, Andras Hajnal, Eric C. Milner
Publication date: 1972
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
Telephone Problems with Failures ⋮ A Problem with Telephones ⋮ Quick gossiping without duplicate transmissions ⋮ Optimal algorithms for dissemination of information in generalized communication modes ⋮ Methods and problems of communication in usual networks ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ The partial gossiping problem ⋮ Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ Tighter time bounds on fault-tolerant broadcasting and gossiping ⋮ NP-Completeness in the gossip monoid ⋮ Reordered gossip schemes ⋮ Dynamic gossip ⋮ Partial Shuffles by Lazy Swaps ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ The epistemic gossip problem ⋮ A survey of gossiping and broadcasting in communication networks ⋮ A class of solutions to the gossip problem. I ⋮ Possible Worlds Semantics Based on Observation and Communication ⋮ Connectivity and inference problems for temporal networks ⋮ A lightweight epistemic logic and its application to planning ⋮ Efficient broadcast trees for weighted vertices ⋮ On Gossiping with Faulty Telephone Lines ⋮ Set to set broadcasting in communication networks ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ The communication problem on graphs ⋮ Gossips and telegraphs ⋮ Multicommodity Multicast, Wireless and Fast ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ Gossips and telephones ⋮ Toward optimal gossiping schemes with conference calls ⋮ Gossiping old ladies ⋮ The number of rounds needed to exchange information within a graph ⋮ Lossy gossip and composition of metrics
