An enumerative algorithm for the maximum clique problem
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 p...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/1867/1/FH03-FIK-20-37014.pdf http://eprints.unisza.edu.my/1867/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my-unisza-ir.1867 |
|---|---|
| record_format |
eprints |
| spelling |
my-unisza-ir.18672020-11-23T08:04:04Z http://eprints.unisza.edu.my/1867/ An enumerative algorithm for the maximum clique problem Mustafa, Mamat Suyudi, M. Sukono, . Bon, A.T. QA Mathematics 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. 2019 Conference or Workshop Item NonPeerReviewed text en http://eprints.unisza.edu.my/1867/1/FH03-FIK-20-37014.pdf 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. |
| 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 |
| spellingShingle |
QA Mathematics Mustafa, Mamat Suyudi, M. Sukono, . Bon, A.T. An enumerative algorithm for the maximum clique problem |
| description |
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. |
| format |
Conference or Workshop Item |
| author |
Mustafa, Mamat Suyudi, M. Sukono, . Bon, A.T. |
| author_facet |
Mustafa, Mamat Suyudi, M. Sukono, . Bon, A.T. |
| author_sort |
Mustafa, Mamat |
| title |
An enumerative algorithm for the maximum clique problem |
| title_short |
An enumerative algorithm for the maximum clique problem |
| title_full |
An enumerative algorithm for the maximum clique problem |
| title_fullStr |
An enumerative algorithm for the maximum clique problem |
| title_full_unstemmed |
An enumerative algorithm for the maximum clique problem |
| title_sort |
enumerative algorithm for the maximum clique problem |
| publishDate |
2019 |
| url |
http://eprints.unisza.edu.my/1867/1/FH03-FIK-20-37014.pdf http://eprints.unisza.edu.my/1867/ |
| _version_ |
1684657765089280000 |
| score |
13.2014675 |