A METHOD FOR COMPUTING UPPER BOUNDS ON THE SIZE OF A MAXIMUM CLIQUE |
Kim, Koon-Chan (Department of Mathematics Keimyung University) |
1 |
A fast algorithm for the maximum clique problem
/
DOI ScienceOn |
2 |
A branch and bound algorithm for the the maximum clique problem
/
DOI ScienceOn |
3 |
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
/
DOI |
4 |
An exact algorithm for the maximum clique problem
/
DOI ScienceOn |
5 |
An upper bound on the size of the largest cliques in a graph
/
DOI |
6 |
An algorithm for finding a maximum clique in a graph
/
DOI ScienceOn |
7 |
/
|
8 |
Some Heuristics for Graph Coloring
/
|
9 |
/
|
10 |
The maximum clique problem
/
DOI |
11 |
An upper bound on the size of a largest clique in a graph
/
DOI |