A Problem with Telephones

@inproceedings{Bumby1981APW,
  title={A Problem with Telephones},
  author={R. Bumby},
  year={1981}
}
This paper deals with the “telephone problem,” also known as the “gossip problem”. Suppose n persons each have a piece of information. Pairs of them can share whatever information they possess by making a telephone call. The question arises, what minimum number of calls allows all n persons to obtain all n pieces of information. The answer is $2n - 4$. One can then ask about properties of such minimal sets of calls. In particular, we prove that the graph whose edges are the calls must contain a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

Better Bounds for Perpetual Gossiping

  • Discrete Applied Mathematics
  • 1997
VIEW 9 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Epistemic Gossip Protocols

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

NP-completeness of Shortest Leaf-to-Leaf Distance in a Tree

  • 2019 International Conference on Computing, Networking and Communications (ICNC)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

Lossy Gossip and Composition of Metrics

  • Discrete & Computational Geometry
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND