| Article ID: | iaor19901082 |
| Country: | Germany |
| Volume: | 34 |
| Start Page Number: | 207 |
| End Page Number: | 217 |
| Publication Date: | Apr 1990 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Babel L., Tinhofer G. |
The authors 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 DSATUR the authors simultaneously derive lower and upper bounds for the clique number.