Brockington M, Culberson JC. (1996). Camouflaging independent sets in quasi-random graphs Cliques, coloring and satisfiability: Second DIMACS implementation challenge.

See more from authors: Brockington M · Culberson JC

References and models cited by this paper
References and models that cite this paper

Pelillo M, Torsello A. (2006). Payoff-monotonic game dynamics and the maximum clique problem. Neural computation. 18 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.