000			01458nam a2200241 4500
001			UPMIN-00000009112
003			UPMIN
005			20230208141627.0
008			230208b |||||||| |||| 00| 0 eng d
040			_aDLC _cUPMin _dupmin
041			_aeng
090			_aLG993.5 2001 _bA64 P37
100	1		_aParedes, Jonathan T. _92170
245	0	0	_aThe exact gossiping problem for 5 messages / _cJonathan T. Paredes
260			_c2001
300			_a16 leaves
502			_aThesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001
520	3		_aThis paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a unique message. A pair of persons can pass to each other all the messages they have by making one telephone call. The exact gossiping problem is to determine the minimum number E(n,k) of calls for each of the n persons to know exactly k messages. Chang and Tsay (1995) studied and gave a solution to E(n,k) for k 4 based from earlier studies done by Richards and Liestman (1988) on partial gossiping. This is an extension of Chang and Tsay's paper where the methods and techniques used by then were utilized for k=5. The study was to obtain the minimum number of E(n,k) calls required for each person to know exactly k messages, for k = 5 only, for all values of n.
658			_aUndergraduate Thesis _cAMAT200, _2BSAM
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c186 _d186