Solution of maximum clique problem by using branch and bound method
The maximum clique problems have been widely applied in the field of operations research. The maximum clique problem is finding a solution that is often considered difficult, as well as graph coloring problem, traveling salesman, and so forth. Solution the maximum clique can be done using seve...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/4934/1/FH02-FIK-14-00728.jpg http://eprints.unisza.edu.my/4934/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Sultan Zainal Abidin |
| Language: | English |
