Gossips and telegraphs

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

Peter J. Slater, Roger Entringer

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

GossipsTelegraphTelephone Gossip Problem

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (16)

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 ⋮ Gossiping with multiple sends and receives ⋮ Reordered gossip schemes ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Parallel algorithms for gossiping by mail ⋮ A class of solutions to the gossip problem. I ⋮ Properties of the Brahmagupta matrix ⋮ Fast information sharing in a complete network ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Efficient multi-agent epistemic planning: teaching planners about nested belief ⋮ Quick gossiping by telegraphs ⋮ Graph theoretical issues in computer networks ⋮ Hierarchical broadcast and gossip networks

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

This page was built for publication: Gossips and telegraphs