Constructing cliques using restricted backtracking

The restricted backtracking algorithmic paradigm is applied to the Maximum Clique Problem. The notion of backtracking coordinates is introduced. The program searches for those cliques whose backtracking coordinates are bounded by the values given in the input.

[1]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[2]  Jonathan W. Berry,et al.  Path optimization and near-greedy analysis for graph partitioning: an empirical study , 1995, SODA '95.

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[5]  Carlo Mannino,et al.  An exact algorithm for the maximum stable set problem , 1994, Comput. Optim. Appl..

[6]  B. Bollobás,et al.  Cliques in random graphs , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[8]  Laura A. Sanchis,et al.  Test Case Construction for the Vertex Cover Problem , 1992, Computational Support for Discrete Mathematics.