Branch and bound algorithm for finding the maximum clique problem

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 an...

Full description

Bibliographic Details

Main Authors:	Suyudi, M., Sukono, ., Mamat, M., Bon, A.T.
Format:	Conference or Workshop Item
Language:	en
Published:	2018
Subjects:	QA Mathematics QA75 Electronic computers. Computer science
Online Access:	http://eprints.unisza.edu.my/1640/1/FH03-FIK-18-14917.jpg http://eprints.unisza.edu.my/1640/
Tags:	Add Tag No Tags, Be the first to tag this record!