## 2 The Algorithms: MC, MCQ, MCR, MCS and BBMC
### Bbmc
#### 2.4.1 BBMC in Java
* [16] [PERSON]; [PERSON] Listing all maximal cliques in large sparse real-world graphs. In _Experimental Algorithms, LNCS 6630. Comput. Sci._**2011**, _6630_, 364-375. * [17] [PERSON] Generating all Combinations and Permutations. In _The Art of Computer Programming_; Pearson Education Inc.: Stoughton, MA, USA, January 2006; Volume 4, pp.1-3. * [18] [PERSON]; [PERSON] Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem. In _Proceedings of the ICTAI'10_; Arras, France, 27-29 October 2010; Volume 1, pp. 344-351. * [19] [PERSON]; [PERSON] Engineering a sort function. _Softw.-Pract. Exp._**1993**, _23_, 1249-1265. * [20] [PERSON] A sufficient condition for backtrack-free search. _J. Assoc. Comput. Mach._**1982**, _29_, 24-32. * [21] [PERSON]; [PERSON] Smallest-Last ordering and clustering and graph coloring algorithms. _J. Assoc. Comput. Mach._**1983**, _30_, 417-427. * [22] [PERSON]; [PERSON] The maximum clique problem. _J. Glob. Optim._**1994**, \(4\), 301-324. * [23] [PERSON]; [PERSON] Algorithm 457: Finding all cliques of an undirected graph [h]. _Commun. ACM_**1973**, _16_, 575-579. * [24] [PERSON] The enumeration of maximal cliques of large graphs. _SIAM J. Comput._**1973**, \(2\), 1-6. * [25] [PERSON]; [PERSON]; [PERSON] The worst-case time complexity for generating all maximal cliques and computational experiments. _Theor. Comput. Sci._**2006**, _363_, 28-42. * [26] [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Kernelization algorithms for the vertex cover problem: Theory and experiments. In _ALENEX/ANALC_; New Orleans, LA, USA, 10-13 January 2004; pp. 62-69. * [27] [PERSON]; [PERSON] A New Implicit Branching Strategy for Exact Maximum Clique. In _Proceedings of ICTAI'10_; Arras, France, 27-29 October 2010; Volume 1, pp. 352-357. * [28] [PERSON]; [PERSON]; [PERSON] Where the Really Hard Problems are. In _Proceedings of the IJCAI'91_, Sidney, Australia, 24-30 August 1991; pp. 331-337. * [29] [PERSON]; [PERSON]; [PERSON]; [PERSON] The Constrainednss of Search. In _Proceedings of the AAAI'96_, Portland, OR, USA, 4-8 August 1996; pp. 246-252. * [30] [PERSON]; [PERSON]; [PERSON] What makes a phase transition? Analysis of the random satisfiability problem. _Physica A_**2010**, _389_, 1501-1511. * [31] DIMACS instances. Available online: [[ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmark](ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmark)]([ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmark](ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmark)) s/clique (accessed on 12 November 2012). * [32] [PERSON]; [PERSON] Collective dynamics of small world networks. _Nature_**1998**, _394_, 440-442. * [33] [PERSON] A branch and bound algorithm for the stability number of a sparse graph. _INFORMS J. Comput._**1998**, _10_, 438-447. * [34] [PERSON] Maximum Clique Algorithms in Java. Available online: [[http://www.dcs.gla.ac.uk/](http://www.dcs.gla.ac.uk/)]([http://www.dcs.gla.ac.uk/](http://www.dcs.gla.ac.uk/)) pat/maxClique (accessed on 12 November 2012). * [35] Stanford Large Network Dataset Collection. Available online: [[http://snap.stanford.edu/data/index.html](http://snap.stanford.edu/data/index.html)]([http://snap.stanford.edu/data/index.html](http://snap.stanford.edu/data/index.html)) (accessed on 12 November 2012). * [36] Benchmarks with Hidden Optimum Solutions. Available online: [[http://www.nlsde.buaa.edu.cn/kexu/benchmarks/graph-benchmarks.htm](http://www.nlsde.buaa.edu.cn/kexu/benchmarks/graph-benchmarks.htm)]([http://www.nlsde.buaa.edu.cn/kexu/benchmarks/graph-benchmarks.htm](http://www.nlsde.buaa.edu.cn/kexu/benchmarks/graph-benchmarks.htm)) (accessed on 12 November 2012). * [37] Dfmax. Available online: [[ftp://dimacs.rutgers.edu/pub/dsj/clique](ftp://dimacs.rutgers.edu/pub/dsj/clique)]([ftp://dimacs.rutgers.edu/pub/dsj/clique](ftp://dimacs.rutgers.edu/pub/dsj/clique)) (accessed on 12 November 2012).