標題: The exact gossiping problem
作者: Tsay, YJ
Chang, GJ
應用數學系
Department of Applied Mathematics
關鍵字: gossip;broadcast;call;multigraph;tree;component
公開日期: 15-一月-1997
摘要: This paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a message. A pair of persons can pass all messages they have by making one telephone call. The exact gossiping problem is to determine the minimum number of calls for each person to know exactly k messages. This paper gives solution to the problem for k less than or equal to 4 or i + 2(k - i - 2) less than or equal to n less than or equal to i - 2 + 2(k - i - 1) with k/2 - 1 less than or equal to i less than or equal to k - 4.
URI: http://hdl.handle.net/11536/779
ISSN: 0012-365X
期刊: DISCRETE MATHEMATICS
Volume: 163
Issue: 1-3
起始頁: 165
結束頁: 172
顯示於類別:期刊論文


文件中的檔案:

  1. A1997WD57700013.pdf