## Relaxation Labeling Networks for the Maximum Clique Problem (1995)

Venue: | J. Artif. Neural Networks |

Citations: | 27 - 17 self |

### BibTeX

@ARTICLE{Pelillo95relaxationlabeling,

author = {Marcello Pelillo},

title = {Relaxation Labeling Networks for the Maximum Clique Problem},

journal = {J. Artif. Neural Networks},

year = {1995},

volume = {2},

pages = {313--328}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper, it is shown how to take advantage of the properties of these models to approximately solve the maximum clique problem, a well-known intractable optimization problem which has practical applications in various fields. The approach is based on a result by Motzkin and Straus which naturally leads to formulate the problem in a manner that is readily mapped onto a relaxation labeling network. Extensive simulations have demonstrated the validity of the proposed model, both in terms of quality of solutions and speed. Maximum clique problem, relaxation labeling processes, neural networks, optimization. 1 INTRODUCTION