The partial gossiping problem

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chang, GJ	en_US
dc.contributor.author	Tsay, YJ	en_US
dc.date.accessioned	2014-12-08T15:02:54Z	-
dc.date.available	2014-12-08T15:02:54Z	-
dc.date.issued	1996-01-15	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/1502	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.title	The partial gossiping problem	en_US
dc.type	Article	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	148	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	9	en_US
dc.citation.epage	14	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1996TQ59900002	-
dc.citation.woscount	3	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。