| _version_ |
1860799664896344064
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2018-08-29 11:16:58
|
| eventvenue |
Bandung, Indonesia
|
| format |
Restricted Document
|
| id |
6908
|
| institution |
UniSZA
|
| originalfilename |
1640-01-FH03-FIK-18-14917.jpg
|
| person |
norman
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6908
|
| spelling |
6908 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=6908 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper image/jpeg inches 96 96 norman 750 1411 76 76 2018-08-29 11:16:58 1411x750 1640-01-FH03-FIK-18-14917.jpg UniSZA Private Access 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 and upper bounds for the clique number. 8th International Conference on Industrial Engineering and Operations Management Bandung, Indonesia
|
| spellingShingle |
Branch and bound algorithm for finding the maximum clique problem
|
| summary |
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.
|
| title |
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_short |
Branch and bound algorithm for finding the maximum clique problem
|
| title_sort |
branch and bound algorithm for finding the maximum clique problem
|