The exact gossiping problem

檔案

日期

1997-01-15

期刊名稱

DISCRETE 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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsay, Y., & Chang, G. (1997). The exact gossiping problem. DISCRETE MATHEMATICS, 163(1-3), 165–172. https://ir.lib.nycu.edu.tw/handle/11536/779

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/779