Gossips and telegraphs

DOI10.1016/0016-0032(79)90004-8zbMath0408.05051MaRDI QIDQ1258315

Roger Entringer, Peter J. Slater

Publication date: 1979

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(79)90004-8

zbMATH Keywords

Gossips; Telegraph; Telephone Gossip Problem

Mathematics Subject Classification ID

05C99: Graph theory

Related Items

Properties of the Brahmagupta matrix, Parallel algorithms for gossiping by mail, A class of solutions to the gossip problem. I, Fast information sharing in a complete network, Optimal algorithms for dissemination of information in some interconnection networks, Quick gossiping by telegraphs, Graph theoretical issues in computer networks, Methods and problems of communication in usual networks, Note on optimal gossiping in some weak-connected graphs, Optimal algorithms for broadcast and gossip in the edge-disjoint modes, Deterministic broadcasting time with partial knowledge of the network., Hierarchical broadcast and gossip networks, Gossiping with multiple sends and receives, Reordered gossip schemes

Cites Work

• Unnamed Item
• New gossips and telephones
• The communication problem on graphs
• Spreading information by conferences
• Gossips and telephones
• Information Dissemination in Trees
• Efficient Communication by Phone Calls
• A Cure for the Telephone Disease