Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model
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. Ou...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE Computer Society
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84905376914&partnerID=40&md5=f4f36b6c70a0b7c9950b2429abda3115 http://cmuir.cmu.ac.th/handle/6653943832/37645 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | 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. © 2014 IEEE. |
|---|