The exact gossiping problem for K>8 messages / Shaira Kim I. Ceballo.

By:

Ceballo, Shaira Kim I

Material type: Text

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 given

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 1 )
Comments ( 0 )
Images

Holdings
Cover 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

Browsing College of Science and Mathematics shelves, Shelving location: Theses, Collection: Room-Use Only Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	LG 993.5 2010 F62 I43 Production of candied jackfruit (Artocarpus heterophyllus) rags by combined osmotic and hot-air drying /	LG993.5 2010 F62 L34 Substitution of sago (Metroxylon sagu Rottb.) flour in ready-mix gelatin dessert and utilization of malunggay (Moringa oleifera) leaf powder as an added ingredient / Ladores, Trina Faye Cruz	LG 993.5 2011 A64 B66 Diversity index-based measure of commonness : bridging the gap between diversity and commonness /	LG 993.5 2011 A64 C33 The exact gossiping problem for K>8 messages /	LG 993.5 2011 A64 C83 Firefly algorithm applied in data clustering /	LG 993.5 2011 A64 E88 Spatial interpolation of monthly rainfall data /	LG 993.5 2011 A64 F37 Dissimilarity coefficients in hierarchical clustering for mixed and fuzzy feature variable /	Next

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.

to post a comment.

Click on an image to view it in the image viewer