Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, GJen_US
dc.contributor.authorTsay, YJen_US
dc.date.accessioned2014-12-08T15:02:54Z-
dc.date.available2014-12-08T15:02:54Z-
dc.date.issued1996-01-15en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/1502-
dc.description.abstractThis 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.isoen_USen_US
dc.titleThe partial gossiping problemen_US
dc.typeArticleen_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume148en_US
dc.citation.issue1-3en_US
dc.citation.spage9en_US
dc.citation.epage14en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:A1996TQ59900002-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. A1996TQ59900002.pdf