| Article ID: | iaor19911062 |
| Country: | Netherlands |
| Volume: | 9 |
| Issue: | 6 |
| Start Page Number: | 375 |
| End Page Number: | 382 |
| Publication Date: | Nov 1990 |
| Journal: | Operations Research Letters |
| Authors: | Carraghan Randy, Pardalos Panos M. |
A partially enumerative algorithm is presented for the maximum clique problem which is very simple to implement. Computational results for an efficient implementation on an IBM 3090 computer are provided for randomly generated graphs with up to 3000 vertices and over one million edges. Also provided are exact specifications for test problems to facilitate future comparisons. In addition, the Fortran 77 code of the proposed algorithm is given.