Browsing by Author "Tsay, YJ"

Now showing 1 - 2 of 2

The exact gossiping problem
(1997-01-15)
Tsay, YJ
;
Chang, GJ
;
應用數學系
;
Department of Applied Mathematics
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.
The partial gossiping problem
(1996-01-15)
Chang, GJ
;
Tsay, YJ
;
應用數學系
;
Department of Applied Mathematics
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.