The exact gossiping problem for K>8 messages / Shaira Kim I. Ceballo.
Material type: TextLanguage: English Publication details: 2011Description: 42 leavesSubject(s): Abstract: This study of the exact gossiping problem extended the results for k ≥ 8 messages. In generating the minimum number of call sequence, a step by step process was created to generate E(n,k), the minimum number of call sequence where n is the number of vertices and k the number of messages, which consequently produced the initial function. Three Lemmas were presented and were proven. These lemmas were used to prove the theorem for the exact gossiping problem k ≥ 8 messages. The resulting function used in the problem is givenCover image | Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
|
Thesis | University Library Theses | Room-Use Only | LG 993.5 2011 A64 C33 (Browse shelf(Opens below)) | Not For Loan | 3UPML00012786 | |
|
Thesis | University Library Archives and Records | Preservation Copy | LG 993.5 2011 A64 C33 (Browse shelf(Opens below)) | Not For Loan | 3UPML00033544 |
This study of the exact gossiping problem extended the results for k ≥ 8 messages. In generating the minimum number of call sequence, a step by step process was created to generate E(n,k), the minimum number of call sequence where n is the number of vertices and k the number of messages, which consequently produced the initial function. Three Lemmas were presented and were proven. These lemmas were used to prove the theorem for the exact gossiping problem k ≥ 8 messages. The resulting function used in the problem is given
There are no comments on this title.