Selecting a set of conflict-free group activities
Date of Publication
2000
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This study introduced scheduling conflict-free group activities for a dating service with divorced couples as their clients. Here, conflict-free group activities refer to sequences of group activities where each client refuses to attend one common party or activity with his/her ex-spouse. This thesis would prove that it is possible to arrange a sequence of group activities in such a way that no two former couples attend the same party or activity, and yet each client parties exactly once with the other clients of the opposite sex. The problem is reformulated as a graph partitioning problem, which uses the concept of bipartite graph and biclique partition, and as matrix factorization problem, which uses the concept of reduced adjacency matrix. The researchers discussed the use of elementary linear algebra to solve the problem. Detailed proofs of some theorems and lemmas and illustrations of concepts through examples are given. This thesis is based mainly in Section 1 to 4 and the first 2 paragraphs of the Epilogue of the article entitled Scheduling Conflict-free Parties for a dating service by Bryan L. Shader and Chanyong Lee Shader.
Abstract Format
html
Language
English
Format
Accession Number
TU10026
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
105 numb. leaves
Recommended Citation
Lagman, G. A., & Lao, A. R. (2000). Selecting a set of conflict-free group activities. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16998