| _version_ |
1860800054527262720
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2020-04-15 03:50:38
|
| eventvenue |
Riyadh, Saudi Arabia
|
| format |
Restricted Document
|
| id |
8462
|
| institution |
UniSZA
|
| originalfilename |
1867-01-FH03-FIK-20-37014.pdf
|
| person |
Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML
like Gecko) Chrome/80.0.3987.149 Safari/537.36
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8462
|
| spelling |
8462 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=8462 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper application/pdf 3 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in Mozilla/5.0 (Windows NT 6.1; Win64; x64) AppleWebKit/537.36 (KHTML like Gecko) Chrome/80.0.3987.149 Safari/537.36 2020-04-15 03:50:38 1867-01-FH03-FIK-20-37014.pdf UniSZA Private Access 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 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. 1st GCC International Conference on Industrial Engineering and Operations Management, IEOM 2019 Riyadh, Saudi Arabia
|
| spellingShingle |
An enumerative algorithm for the maximum clique problem
|
| summary |
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.
|
| title |
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_short |
An enumerative algorithm for the maximum clique problem
|
| title_sort |
enumerative algorithm for the maximum clique problem
|