Mustafa, Mamat and Suyudi, M. and Sukono, . and Bon, A.T. (2019) An enumerative algorithm for the maximum clique problem. In: 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019, 26-28 November 2019, riyadh; Saudi Arabia.
![[img]](http://eprints.unisza.edu.my/style/images/fileicons/text.png) |
Text
FH03-FIK-20-37014.pdf Restricted to Registered users only Download (290kB) |
Abstract
Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. Search results for efficient implementation of any graph for randomly generated graphs of up to 10 vertices and more than ten sides. Appropriate specifications are also provided for testing problems to facilitate future comparisons. In addition, to understand the maximum clique search without using any software. Search results are presented in the form of examples.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Current best clique, Enumerative algorithm, Maximum clique |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Informatics & Computing |
| Depositing User: | Muhammad Akmal Azhar |
| Date Deposited: | 23 Nov 2020 08:04 |
| Last Modified: | 23 Nov 2020 08:04 |
| URI: | http://eprints.unisza.edu.my/id/eprint/1867 |
Actions (login required)
 |
View Item |
