[
[1] I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization Vol. 4, Kluwer Academic Publisher, 1999. ⇒12310.1007/978-1-4757-3023-4_1
]Search in Google Scholar
[
[2] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 2003. ⇒123
]Search in Google Scholar
[
[3] J. Hasselberg, P. M. Pardalos, G. Vairaktarakis, Test case generators and computational results for the maximum clique problem, Journal of Global Optimization 3 (1993) 463–482. ⇒13210.1007/BF01096415
]Search in Google Scholar
[
[4] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., Reading, MA 1994. ⇒123
]Search in Google Scholar
[
[5] N. J. A. Sloane, Challenge Problems: Independent Sets in Graphs. https://oeis.org/A265032/a265032.html ⇒132
]Search in Google Scholar
[
[6] S. Szabó, Monotonic matrices and clique search in graphs, Annales Univ. Sci. Budapest., Sect. Computatorica 41 (2013), 307–322. ⇒132
]Search in Google Scholar
[
[7] E. W. Weisstein, Monotonic Matrix, In: MathWorld–A Wolfram Web Resource. http://mathworld.wolfram.com/MonotonicMatrix.html ⇒132
]Search in Google Scholar
