References
- Wikipedia, "Clique (Graph Theory), http://en.wikipedia.org/wiki/Clique_(graph_theory), Wikimedia Foundation Inc., 2014.
- Wikipedia, "Karp's 21 NP-complete Problems, http://en.wikipedia.org/wiki/Karp's_21_NP-complete_problems, Wikimedia Foundation Inc., 2014.
- C. Umans, "CS21: Decidability and Tractability," Computer Science, California Institute of Technology, http://www.cs.caltech.edu/-umans/cs21/lec21.pdf, 2009.
- Q. Ouyang, P. D. Kaplan, S. Liu, and L. Shumao, "DNA Solution of the Maximal Clique Problem," Science Vol. 278, pp. 446-449, 1997. https://doi.org/10.1126/science.278.5337.446
- H. J. Kim. "Finding Clique Using Backtracking Algorithm," University of Washington, 2006.
- E. W. Weisstein, "Complete Graph," Mathworld, http://mathworld.wolfram.com/CompleteGraph.html, 2014.
- E. W. Weisstein, "Peterson Graph," Mathworld, http://mathworld.wolfram.com/PetersonGraph.html, 2014.
- A. Dharwadker, "The Clique Algorithm," http://www.geocities.com/dharwadker/clique, 2006.
- P. R. J. Ostergard, "A Fast Algorithm for the Maximum Clique Problem," Discrete Applied Mathematics, Vol. 120, No. 1-3, pp. 197-207, Aug. 2002. https://doi.org/10.1016/S0166-218X(01)00290-6
- W. Pullan and H. H. Hoos, "Dynamic Local Search for the Maximum Clique Problem," Journal of Artificial Intelligence Research, Vol. 25, No. 1, pp. 159-185, Jan. 2006.
- W. Pullan, "Phased Local Search for the Maximum Clique Problem," Journal of Combinatorial Optimization, Vol. 12, No. 3, pp. 303-323, Nov. 2006. https://doi.org/10.1007/s10878-006-9635-y
- W. Pullan, F. Mascia, and M. Brunato, "Cooperating Local Search for the Maximum Clique Problem," Journal of Heuristics, Vol. 17, No. 2, pp. 181-199, Apr. 2011. https://doi.org/10.1007/s10732-010-9131-5
- L. Xiangmei, D. Fei, and Z. Shao, "A Local Search Algorithm for the Maximum Clique Problem," Journal of Convergence Information Technology, Vol. 7, No. 14, pp. 65-70, Aug. 2012. https://doi.org/10.4156/jcit.vol7.issue14.8
- S. Balaji, "A New Effective Local Search Heuristic for the Maximum Clique Problem," World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical and Quantum Engineering, Vol. 7, No. 5, pp. 523-529, May 2013.
- Z. O. Akbari, "A Polynomial-Time Algorithm for the Maximum Clique Problem," IEEE/ACIS 12th International Conference on Computer and Information Science, pp. 503-507, Jun. 2013.
- J. Konc and D. Janezic, "An Improved Branch and Bound Algorithm for the Maximum Clique Problem," MATCH Communications in Mathematical and in Computer Chemistry, Vol. 58, No. 3, pp. 569-590, Dec. 2007.
- Wikipedia, "Degree (Graph Theory)," http://en.wikipedia.org/wiki/Degree_(graph-th eory), Wikimedia Foundation Inc., 2014.
- P. M. Pardalos, "ESI 6448 Discrete Optimization Theory: Cliques, Quasi-cliques and Clique Partitions in Graphs," Department of Industrial and Systems Engineering, University of Florida, 2008.
- Y. D. Lyuu, "Clique," Dept. of Computer Science & Information Engineering, National Taiwan University, 2004.
- Mukul S. Bansal and V. Ch. Venkaiah, "A Note on Finding a Maximum Clique in a Graph Using BDDs", Australasian Journal of Combinatorics, Vol. 32, No. 1, pp. 253-258, Jan. 2005.
- A. Dharwadker, "The Vertex Coloring Algorithm," http://www.geocities.com/dharwadker/vertex_coloring/, 2006.
- K. Xu, "Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination," Computer Science, National Laboratory of Software Development Environment, Department of Computer Science and Engineering, Beijing University of Aeronautics and Astronautics, 2009.