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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 言語: | English |
| 出版事項: |
2018
|
| 主題: | |
| オンライン･アクセス: | http://eprints.unisza.edu.my/1640/1/FH03-FIK-18-14917.jpg http://eprints.unisza.edu.my/1640/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
