000			02048nam a2200241 4500
001			UPMIN-00000009113
003			UPMIN
005			20230208104433.0
008			230208b |||||||| |||| 00| 0 eng d
040			_aDLC _cUPMin _dupmin
041			_aeng
090			_aLG993.5 2003 _bA64 P33
100	1		_aPaderanga, Melissa D. _92152
245	0	0	_aThe exact gossiping problem for six messages / _cMelissa D. Paderanga
260			_c2003
300			_a29 leaves
502			_aThesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
520	3		_aThe integration of the telecommunication industry and computer industry is a distinct feature of the advancements of a third-wave technology. Communication, hence, the transfer of information between a source and a receiver, has portrayed a significant role in information dissemination. Information dissemination develop into different modes as one-to-one communication such as telegraph, telephone calls, conversations, radio communications and gossiping among others; one-to-many communication such as broadcasting, SMS applications, and multimedia messaging services; and many?to-many communication through groupwares, videoconferencing, and multimedia chat forums. For example, in teleconferencing, people in different regions are allowed to attend meetings using telephone lines. Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network through the concepts of graph. In a gossiping problem, each node (corresponding to each of the n person) has a unique piece of information that must be transmitted to all other nodes. This study presents a mathematical model, for a given number of exactly n persons, denoted by E(n,k) for each n person to know exactly k messages. This study focuses on the minimum number of calls of E(n,k) for k=6 messages and for all values of n.
658			_aUndergraduate Thesis _cAMAT200, _2BSAM
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c187 _d187