References
- Amin , A. T. and Hakimi , S. L. 1972 . Upper bounds on the order of a clique of a graph . SIAM Journal of Applied Mathematics , 22 ( No. 4 ) : 569 – 573 .
- Balas , E. and Yu , C. S. 1986 . Finding the maximum clique in an arbitrary graph . SIAM Journal on Computing , 15 ( No. 4 ) : 1054 – 1068 .
- Bron , C. and Kerbosch , J. 1973 . Finding all cliques of an undirected graph . Communications of the ACM , 16 ( No. 9 ) : 575 – 577 .
- Gerhards , L. and Lindenberg , W. 1979 . Clique detection for nondirected graphs: Two new algorithms . Computing , 21 ( No. 4 ) : 295 – 322 .
- Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , New York : W. H. Freeman .
- Hager W. W. Pardalos P. M. Roussos I. M. Sahinoglou H. D. Active constraints in optimization.Department of Mathematics The Pennsylvania State University University Park, PA 1987
- Loukakis , E. and Tsouros , C. 1982 . Determining the number of internal stability of a graph . International Journal of Computer Mathematics , 11 ( Nos. 3+4 ) : 207 – 220 .
- Motzkin , T. S. and Straus , E. G. 1965 . Maxima for graphs and a new proof of a theorem of Turán . Canadian Journal of Mathematics , 17 ( No. 4 ) : 533 – 540 .
- Pardalos P. M. Rodgers G. P. A branch and bound algorithm for the maximum clique problem Department of Computer Science, The Pennsylvania State University University Park, PA 1988
- Pardalos P. M. Rosen J. B. Constrained global optimization: Algorithms and applications Goos G. Hartmanis J. Springer-Verlag Berlin 1987 Lecture Notes in Computer Science 268
- Phillips A. T. Parallel algorithms for constrained optimization University of Minnesota Minneapolis, MN 1988 Ph.D. dissertation
- Tarjan , R. E. and Trojanowski , A. E. 1977 . Finding a maximum independent set . SIAM Journal on Computing , 6 ( No. 3 ) : 537 – 546 .