Suyudi, M. and Sukono, . and Mamat, M. and Bon, A.T. (2018) Branch and bound algorithm for finding the maximum clique problem. In: 8th International Conference on Industrial Engineering and Operations Management, 01 Mac 2018, Bandung, Indonesia.
![[img]](http://eprints.unisza.edu.my/1640/1/FH03-FIK-18-14917.jpg) |
Image
FH03-FIK-18-14917.jpg Restricted to Registered users only Download (151kB) |
Abstract
We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. The main part of the algorithm consists in the determination of upper bounds by graph colorings. Using a modification of a known graph coloring method called heuristic greedy we simultaneously derive lower and upper bounds for the clique number.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Informatics & Computing |
| Depositing User: | Muhammad Akmal Azhar |
| Date Deposited: | 19 Nov 2020 03:13 |
| Last Modified: | 19 Nov 2020 03:13 |
| URI: | http://eprints.unisza.edu.my/id/eprint/1640 |
Actions (login required)
 |
View Item |
