Cover Image

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

Saved in:
Bibliographic Details
Main Authors: Suyudi, M., Sukono, ., Mamat, M., Bon, A.T.
Format: Conference or Workshop Item
Language:English
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!
id my-unisza-ir.1640
record_format eprints
spelling my-unisza-ir.16402020-11-19T03:13:43Z http://eprints.unisza.edu.my/1640/ Branch and bound algorithm for finding the maximum clique problem Suyudi, M. Sukono, . Mamat, M. Bon, A.T. QA Mathematics QA75 Electronic computers. Computer science 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. 2018 Conference or Workshop Item NonPeerReviewed image en http://eprints.unisza.edu.my/1640/1/FH03-FIK-18-14917.jpg 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.
institution Universiti Sultan Zainal Abidin
building UNISZA Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Sultan Zainal Abidin
content_source UNISZA Institutional Repository
url_provider https://eprints.unisza.edu.my/
language English
topic QA Mathematics
QA75 Electronic computers. Computer science
spellingShingle QA Mathematics
QA75 Electronic computers. Computer science
Suyudi, M.
Sukono, .
Mamat, M.
Bon, A.T.
Branch and bound algorithm for finding the maximum clique problem
description 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.
format Conference or Workshop Item
author Suyudi, M.
Sukono, .
Mamat, M.
Bon, A.T.
author_facet Suyudi, M.
Sukono, .
Mamat, M.
Bon, A.T.
author_sort Suyudi, M.
title Branch and bound algorithm for finding the maximum clique problem
title_short Branch and bound algorithm for finding the maximum clique problem
title_full Branch and bound algorithm for finding the maximum clique problem
title_fullStr Branch and bound algorithm for finding the maximum clique problem
title_full_unstemmed Branch and bound algorithm for finding the maximum clique problem
title_sort branch and bound algorithm for finding the maximum clique problem
publishDate 2018
url http://eprints.unisza.edu.my/1640/1/FH03-FIK-18-14917.jpg
http://eprints.unisza.edu.my/1640/
_version_ 1684657730305916928
score 13.244745

Similar Items