Title :
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model
Author :
Juneam, Nopadon ; Kantabutra, Sanpawat
Author_Institution :
Dept. of Comput. Sci., Chiang Mai Univ., Chiang Mai, Thailand
Abstract :
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P.
Keywords :
computational complexity; social networking (online); social sciences; compatible wellness group problem; decision problems; polynomial-time algorithms; social networking; target member problem; time complexity; wellness profile model; Availability; Computational modeling; Educational institutions; Heuristic algorithms; Social network services; Time complexity; algorithms; computational-complexity theory; social networking; wellness applications;
Conference_Titel :
Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON), 2014 11th International Conference on
Conference_Location :
Nakhon Ratchasima
DOI :
10.1109/ECTICon.2014.6839741
