Set to Set Broadcasting in Communication Networks

@article{Lee1992SetTS,
  title={Set to Set Broadcasting in Communication Networks},
  author={Hsun-Ming Lee and Gerard J. Chang},
  journal={Discrete Applied Mathematics},
  year={1992},
  volume={40},
  pages={411-421}
}
Abstract Suppose G = ( V,E ) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V . The main purpose of this paper is to study the minimum number b ( A,B… CONTINUE READING
BETA

Similar Papers

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Gossiping in grid graphs

A. Farley, A. Proskurowski
  • J. Combin. Inform. System Sci. 5
  • 1980
VIEW 1 EXCERPT

The general gossip problem

M. C. Golumbic
  • Tech. Rept., IBM Res. Rept. RC 4977, IBM
  • 1974
VIEW 1 EXCERPT

The gossip problem

  • Discrete Mathematics
  • 1973
VIEW 2 EXCERPTS

Gossips and telephones

  • Discrete Mathematics
  • 1972
VIEW 3 EXCERPTS