论文信息 - The partial gossiping problem

The partial gossiping problem

Abstract This paper studies the following variation of the gossiping problem. Suppose there are n persons, each of whom knows a message. A pair of persons can pass all messages they have by making a telephone call. The partial gossiping problem is to determine the minimum number of calls needed for each person to know at least k messages. This paper gives a complete solution to this problem.

Gerard J. Chang | Yuh-Jiuan Tsay | G. Chang | Yuh-Jiuan Tsay

[1] Daniel J. Kleitman,et al. Further gossip problems , 1980, Discret. Math..

[2] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[3] Alex Bavelas,et al. Communication Patterns in Task‐Oriented Groups , 1950 .

[4] Walter Knödel,et al. New gossips and telephones , 1975, Discret. Math..

[5] Dana S. Richards,et al. Generalizations of broadcasting and gossiping , 1988, Networks.

[6] E. C. Milner,et al. A Cure for the Telephone Disease , 1972, Canadian Mathematical Bulletin.

[7] Frank Harary,et al. The communication problem on graphs and digraphs , 1974 .

[8] Gerald Berman. The gossip problem , 1973, Discret. Math..

[9] Brenda S. Baker,et al. Gossips and telephones , 1972, Discret. Math..

[10] R. Bumby. A Problem with Telephones , 1981 .