论文信息 - A global optimization approach for solving the maximum clique problem

A global optimization approach for solving the maximum clique problem

The problem of finding a maximum clique of an undirected graph is formulated and solved as a linearly constrained indefinite quadratic global optimization problem. Theoretical upper and lower bounds on the size k of the maximum clique are derived from the global optimization formulation, and a relationship between the set of distinct global maxima of the optimization problem and the set of distinct maximum cliques of the graph is discussed. In addition, some preliminary computational results are also presented.

P. Pardalos | A. Phillips

[1] T. Motzkin,et al. Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[2] S. L. Hakimi,et al. Upper Bounds on the Order of a Clique of a Graph , 1972 .

[3] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .

[4] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] E. Loukakis,et al. Determining the number of internal stability of a graph , 1982 .

[7] Egon Balas,et al. Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[8] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[9] A. Phillips,et al. Parallel algorithms for constrained optimization , 1988 .