Continuous Characterizations of the Maximum Clique


Given a graph G whose adjacency matrix is A, the Motzkin-Strauss formulation of the Maximum-Clique Problem is the quadratic program maxfxTAxjxT e = 1; x 0g. It is well known that the global optimum value of this QP is (1 1=!(G)), where !(G) is the clique number of G. Here, we characterize the following: 1) rst order optimality 2) second order optimality 3… (More)


Cite this paper

@inproceedings{Gibbons1996ContinuousCO, title={Continuous Characterizations of the Maximum Clique}, author={Luana E. Gibbons and Donald W. Hearn and Panos M. Pardalos and Motakuri V. Ramana}, year={1996} }