Editing Clique problem (section)

===Research articles===
{{refbegin|30em}}
*{{citation |last1=Abello |first1=J. |last2=Pardalos |first2=P. M. |last3=Resende |first3=M. G. C. | author3-link=Mauricio Resende |contribution=On maximum clique problems in very large graphs |title=External Memory Algorithms |editor1-first=J. |editor1-last=Abello |editor2-first=J. |editor2-last=Vitter |editor2-link=Jeffrey Vitter |series=DIMACS Series on Discrete Mathematics and Theoretical Computer Science |volume=50 |pages=119–130 |year=1999 |publisher=[[American Mathematical Society]] |contribution-url=http://www.mgvis.com/Papers/MassiveDataSets/Cliques.pdf |isbn=0-8218-1184-3 |access-date=2017-01-13 |archive-date=2017-01-16 |archive-url=https://web.archive.org/web/20170116182554/http://www.mgvis.com/Papers/MassiveDataSets/Cliques.pdf |url-status=dead }}.
*{{citation |first1=N. |last1=Alon |author1-link=Noga Alon |first2=R. |last2=Boppana |title=The monotone circuit complexity of boolean functions |journal=[[Combinatorica]] |volume=7 |issue=1 |year=1987 |pages=1–22 |doi=10.1007/BF02579196|s2cid=17397273 }}.
*{{citation |first1=N. |last1=Alon |author1-link=Noga Alon |first2=M. |last2=Krivelevich |first3=B. |last3=Sudakov |title=Finding a large hidden clique in a random graph |journal=Random Structures & Algorithms |volume=13 |issue=3–4 |year=1998 |pages=457–466 |doi=10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W}}.
*{{citation | last1 = Alon | first1 = N. | author1-link = Noga Alon | last2 = Yuster | first2 = R. | author2-link = Raphael Yuster | last3 = Zwick | first3 = U. | author3-link = Uri Zwick | contribution = Finding and counting given length cycles | pages = 354–364 | title = Proceedings of the 2nd European Symposium on Algorithms, Utrecht, The Netherlands | year = 1994}}.
*{{citation
 | last1 = Amano | first1 = Kazuyuki
 | last2 = Maruoka | first2 = Akira
 | doi = 10.1137/S0097539701396959
 | issue = 1
 | journal = [[SIAM Journal on Computing]]
 | mr = 2178806
 | pages = 201–216
 | title = A superpolynomial lower bound for a circuit computing the clique function with at most {{math|(1/6)log log ''N''}} negation gates
 | volume = 35
 | year = 2005}}.
*{{citation |title=Proof verification and the hardness of approximation problems |first1=Sanjeev |last1=Arora |author1-link=Sanjeev Arora |first2=Carsten |last2=Lund |author2-link=Carsten Lund |first3=Rajeev |last3=Motwani |author3-link=Rajeev Motwani |first4=Madhu |last4=Sudan |author4-link=Madhu Sudan |first5=Mario |last5=Szegedy |author5-link=Mario Szegedy |journal=[[Journal of the ACM]] |volume=45 |issue=3 |year=1998 |pages=501–555 |doi=10.1145/278298.278306 |s2cid=8561542 |id={{ECCC|1998|98|008}}}}. Originally presented at the 1992 [[Symposium on Foundations of Computer Science]], {{doi|10.1109/SFCS.1992.267823}}.
*{{citation |first1=S. |last1=Arora |author1-link=Sanjeev Arora |first2=S. |last2=Safra |author2-link=Shmuel Safra |title=Probabilistic checking of proofs: A new characterization of NP |journal=[[Journal of the ACM]] |volume=45 |issue=1 |year=1998 |pages=70–122 |doi=10.1145/273865.273901|s2cid=751563 |doi-access=free }}. Originally presented at the 1992 [[Symposium on Foundations of Computer Science]], {{doi|10.1109/SFCS.1992.267824}}.
*{{citation |last1=Balas |first1=E. |last2=Yu |first2=C. S. |title=Finding a maximum clique in an arbitrary graph |journal=[[SIAM Journal on Computing]] |volume=15 |issue=4 |year=1986 |pages=1054–1068 |doi=10.1137/0215075}}.
*{{citation
 | last1 = Barrow | first1 = H.
 | last2 = Burstall | first2 = R. | author2-link = Rod Burstall
 | doi = 10.1016/0020-0190(76)90049-1
 | issue = 4
 | journal = Information Processing Letters
 | pages = 83–84
 | title = Subgraph isomorphism, matching relational structures and maximal cliques
 | volume = 4
 | year = 1976}}.
*{{citation |last1=Battiti |first1=R. |last2=Protasi |first2=M. |title=Reactive local search for the maximum clique problem |journal=[[Algorithmica]] |volume=29 |issue=4 |year=2001 |pages=610–637 |doi=10.1007/s004530010074|s2cid=1800512 }}.
*{{Citation | last1=Bollobás | first1=Béla | author1-link=Béla Bollobás | title=Complete subgraphs are elusive | year=1976 | journal=[[Journal of Combinatorial Theory]] | series = Series B | issn=0095-8956 | volume=21 | issue=1 | pages=1–7 | doi=10.1016/0095-8956(76)90021-6| doi-access=free }}.
*{{citation |first1=R. |last1=Boppana |first2=M. M. |last2=Halldórsson |title=Approximating maximum independent sets by excluding subgraphs |journal=[[BIT Numerical Mathematics]] |volume=32 |year=1992 |pages=180–196 |doi=10.1007/BF01994876 |issue=2|s2cid=123335474 }}.
*{{citation | last1=Bron | first1=C. | last2=Kerbosch | first2=J. | title=Algorithm 457: finding all cliques of an undirected graph | year=1973 | journal=[[Communications of the ACM]] | doi=10.1145/362342.362367 | volume=16 | issue=9 | pages=575–577| s2cid=13886709 | doi-access=free }}.
*{{citation |last1=Carraghan |first1=R. |last2=Pardalos |first2=P. M. |title=An exact algorithm for the maximum clique problem |journal=Operations Research Letters |volume=9 |year=1990 |pages=375–382 |issue=6 |doi=10.1016/0167-6377(90)90057-C}}.
*{{citation | last1=Cazals | first1=F. | last2=Karande | first2=C. | title=A note on the problem of reporting maximal cliques | year=2008 | journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] | volume=407 | issue=1 | pages=564–568 | doi=10.1016/j.tcs.2008.05.010 | doi-access=free }}.
*{{citation |first1=Jianer | last1=Chen |first2=Xiuzhen | last2=Huang |first3=Iyad A. | last3=Kanj |first4=Ge | last4=Xia | title=Strong computational lower bounds via parameterized complexity | journal=[[Journal of Computer and System Sciences]] | volume=72 | year=2006 | pages=1346–1367 | doi=10.1016/j.jcss.2006.04.007 | issue=8| doi-access=free }}
*{{citation |first1=N. |last1=Chiba |first2=T. |last2=Nishizeki | author2-link = Takao Nishizeki |title=Arboricity and subgraph listing algorithms |journal=[[SIAM Journal on Computing]] |volume=14 |issue=1 |pages=210–223 |year=1985 |doi=10.1137/0214017|s2cid=207051803 }}.
*{{citation |last1=Childs |first1=A. M. |last2=Farhi |first2=E. |last3=Goldstone |first3=J. |author3-link=Jeffrey Goldstone |last4=Gutmann |first4=S. |title=Finding cliques by quantum adiabatic evolution |journal=Quantum Information and Computation |volume=2 |issue=3 |pages=181–191 |year=2002 |arxiv=quant-ph/0012104 |bibcode=2000quant.ph.12104C |doi=10.26421/QIC2.3 |s2cid=33643794 }}.
*{{citation |last1=Childs |first1=A. M. |last2=Eisenberg |first2=J. M. |title=Quantum algorithms for subset finding |journal=Quantum Information and Computation |volume=5 |issue=7 |pages=593–604 |year=2005 |arxiv=quant-ph/0311038|bibcode=2003quant.ph.11038C |doi=10.26421/QIC5.7 |s2cid=37556989 }}.
*{{citation | last1 = Clark | first1 = Brent N. | last2 = Colbourn | first2 = Charles J. | author2-link= Charles Colbourn | author3-link = David S. Johnson | last3 = Johnson | first3 = David S. | title = Unit disk graphs | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]] | volume = 86 | issue = 1–3 | year = 1990 | pages = 165–177 | doi = 10.1016/0012-365X(90)90358-O| doi-access = free }}
*{{citation |first=S. A. |last=Cook |author-link=Stephen Cook |year=1971 |title=Proc. 3rd ACM Symposium on Theory of Computing |pages=151–158 |contribution-url=http://4mhz.de/cook.html |doi=10.1145/800157.805047 |contribution=The complexity of theorem-proving procedures |title-link=Symposium on Theory of Computing |s2cid=7573663 |doi-access=free }}.
*{{citation
 | last = Cook | first = Stephen A. | author-link = Stephen Cook
 | doi = 10.1016/S0019-9958(85)80041-3
 | issue = 1–3
 | journal = [[Information and Control]]
 | mr = 837088
 | pages = 2–22
 | title = A taxonomy of problems with fast parallel algorithms
 | volume = 64
 | year = 1985| doi-access = free
 }}.
*{{citation |title=Computational complexity of inferring phylogenies by compatibility |first1=William H. E. |last1=Day |first2=David |last2=Sankoff |journal=[[Systematic Zoology]] |volume=35 |issue=2 |year=1986 |pages=224–229 |doi=10.2307/2413432 |jstor=2413432}}.
*{{citation |first1=R. G. |last1=Downey |author2-link=Michael Fellows |first2=M. R. |last2=Fellows |title=Fixed-parameter tractability and completeness. II. On completeness for W[1] |journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] |volume=141 |issue=1–2 |year=1995 |pages=109–131 |doi=10.1016/0304-3975(94)00097-3|doi-access=free }}.
*{{citation |first1=F. |last1=Eisenbrand |first2=F. |last2=Grandoni |title=On the complexity of fixed parameter clique and dominating set |journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] |volume=326 |issue=1–3 |pages=57–67 |year=2004 |doi=10.1016/j.tcs.2004.05.009|doi-access=free }}.
*{{citation |first1=David |last1=Eppstein |author1-link=David Eppstein |first2=Maarten |last2=Löffler |first3=Darren |last3=Strash|title= Listing all maximal cliques in large sparse real-world graphs in near-optimal time|year=2013|journal=Journal of Experimental Algorithmics|volume=18|issue=3|page=3.1|doi=10.1145/2543629|arxiv=1103.0318|s2cid=47515491 }}.
*{{citation |first1=Paul |last1=Erdős |author1-link=Paul Erdős |first2=George |last2=Szekeres |author2-link=George Szekeres |title=A combinatorial problem in geometry |journal=[[Compositio Mathematica]] |volume=2 |year=1935 |pages=463–470 |url=http://www.renyi.hu/~p_erdos/1935-01.pdf }}.
*{{citation |first1=S. |last1=Even |author1-link=Shimon Even |first2=A. |last2=Pnueli |author2-link=Amir Pnueli |first3=A. |last3=Lempel |author3-link=Abraham Lempel |title=Permutation graphs and transitive graphs |journal=[[Journal of the ACM]] |volume=19 |issue=3 |pages=400–410 |year=1972 |doi=10.1145/321707.321710|s2cid=9501737 |doi-access=free }}.
*{{citation |first=T. |last=Fahle |title=Proc. 10th European Symposium on Algorithms |series=Lecture Notes in Computer Science |publisher=Springer-Verlag |volume=2461 |year=2002 |pages=47–86 |doi=10.1007/3-540-45749-6_44 |chapter=Simple and fast: Improving a branch-and-bound algorithm for maximum clique |isbn=978-3-540-44180-9|title-link=European Symposium on Algorithms }}.
*{{citation |first=U. |last=Feige |author-link=Uriel Feige |title=Approximating maximum clique by removing subgraphs |journal=[[SIAM Journal on Discrete Mathematics]] |volume=18 |issue=2 |pages=219–225 |year=2004 |doi=10.1137/S089548010240415X}}.
*{{citation |first1=U. |last1=Feige |author1-link=Uriel Feige |first2=S. |last2=Goldwasser |author2-link=Shafi Goldwasser |first3=L. |last3=Lovász |author3-link=László Lovász |first4=S |last4=Safra |author4-link=Shmuel Safra |first5=M. |last5=Szegedy |title=&#91;1991&#93; Proceedings 32nd Annual Symposium of Foundations of Computer Science |author5-link=Mario Szegedy |pages=2–12 |year=1991 |doi=10.1109/SFCS.1991.185341 |chapter=Approximating clique is almost NP-complete |isbn=0-8186-2445-0|title-link=Symposium on Foundations of Computer Science |s2cid=46605913 }}.
*{{citation |first1=U. |last1=Feige |author1-link=Uriel Feige |first2=R. |last2=Krauthgamer |title=Finding and certifying a large hidden clique in a semirandom graph |journal=Random Structures and Algorithms |volume=16 |issue=2 |pages=195–208 |year=2000 |doi=10.1002/(SICI)1098-2418(200003)16:2<195::AID-RSA5>3.0.CO;2-A}}.
*{{citation
 | last1 = Frank | first1 = Ove
 | last2 = Strauss | first2 = David
 | issue = 395
 | journal = [[Journal of the American Statistical Association]]
 | mr = 860518
 | pages = 832–842
 | title = Markov graphs
 | jstor = 2289017
 | volume = 81
 | year = 1986
 | doi=10.2307/2289017}}.
*{{citation |first1=M. R. |last1=Garey |author1-link=Michael R. Garey |first2=D. S. |last2=Johnson |author2-link=David S. Johnson |title="Strong" NP-completeness results: motivation, examples and implications |journal=[[Journal of the ACM]] |volume=25 |pages=499–508 |year=1978 |doi=10.1145/322077.322090 |issue=3|s2cid=18371269 |doi-access=free }}.
*{{citation
 | last1 = Garey | first1 = M. R. | author1-link = Michael R. Garey
 | last2 = Johnson | first2 = D. S. | author2-link = David S. Johnson
 | last3 = Stockmeyer | first3 = L. | author3-link = Larry Stockmeyer
 | doi = 10.1016/0304-3975(76)90059-1
 | issue = 3
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | mr = 0411240
 | pages = 237–267
 | title = Some simplified NP-complete graph problems
 | volume = 1
 | year = 1976| doi-access = free
 }}.
*{{citation | last = Gavril | first = F. | doi = 10.1002/net.3230030305 | issue = 3 | journal = Networks | pages = 261–273 | title = Algorithms for a maximum clique and a maximum independent set of a circle graph | volume = 3 | year = 1973}}.
*{{citation |first1=M. |last1=Goldmann |first2=J. |last2=Håstad |author2-link=Johan Håstad |title=A simple lower bound for monotone clique using a communication game |journal=[[Information Processing Letters]] |volume=41 |issue=4 |year=1992 |pages=221–226 |doi=10.1016/0020-0190(92)90184-W |citeseerx=10.1.1.185.3065 |url=http://www.csc.kth.se/%7Ejohanh/monotoneclique.pdf }}.
*{{Citation | volume = 10 | issue = 3 | pages = 119&ndash;127 | last = Gröger | first = Hans Dietmar | title = On the randomized complexity of monotone graph properties | journal = Acta Cybernetica | access-date = 2009-10-02 | year = 1992 | url = http://www.inf.u-szeged.hu/actacybernetica/edb/vol10n3/pdf/Groger_1992_ActaCybernetica.pdf | archive-date = 2015-09-24 | archive-url = https://web.archive.org/web/20150924034620/http://www.inf.u-szeged.hu/actacybernetica/edb/vol10n3/pdf/Groger_1992_ActaCybernetica.pdf | url-status = dead }}
*{{citation |first1=A. |last1=Grosso |first2=M. |last2=Locatelli |first3=F. |last3=Della Croce |title=Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem |journal=Journal of Heuristics |volume=10 |issue=2 |year=2004 |pages=135–152 |doi=10.1023/B:HEUR.0000026264.51747.7f|s2cid=40764225 }}.
*{{citation |title=Approximations of Weighted Independent Set and Hereditary Subset Problems |first=M. M. |last=Halldórsson |journal=[[Journal of Graph Algorithms and Applications]] |volume=4 |issue=1 |pages=1–16 |year=2000 |doi=10.7155/jgaa.00020|doi-access=free }}.
*{{citation |last1=Hamzaoglu |first1=I. |last2=Patel |first2=J. H. |contribution=Test set compaction algorithms for combinational circuits |title=Proc. 1998 IEEE/ACM International Conference on Computer-Aided Design |year=1998 |pages=283–289 |doi=10.1145/288548.288615|s2cid=12258606 |doi-access=free |isbn=1-58113-008-2 }}.
*{{citation |last1=Harary |first1=F. |author1-link=Frank Harary |last2=Ross |first2=I. C. |title=A procedure for clique detection using the group matrix |journal=Sociometry |volume=20 |year=1957 |pages=205–215 |doi=10.2307/2785673 |issue=3 |publisher=American Sociological Association |mr=0110590 |jstor=2785673}}.
*{{citation |first=J. |last=Håstad |author-link=Johan Håstad |title=Clique is hard to approximate within {{math|''n''<sup>1 &minus; ''ε''</sup>}} |journal=[[Acta Mathematica]] |volume=182 |issue=1 |pages=105–142 |year=1999 |doi=10.1007/BF02392825|doi-access=free }}.
*{{citation |first1=R. |last1=Impagliazzo |author1-link=Russell Impagliazzo |first2=R. |last2=Paturi |first3=F. |last3=Zane |title=Which problems have strongly exponential complexity? |journal=[[Journal of Computer and System Sciences]] |volume=63 |issue=4 |year=2001 |pages=512–530 |doi=10.1006/jcss.2001.1774|doi-access=free }}.
*{{citation |first1=A. |last1=Itai |first2=M. |last2=Rodeh |title=Finding a minimum circuit in a graph |journal=[[SIAM Journal on Computing]] |volume=7 |issue=4 |pages=413–423 |year=1978 |doi=10.1137/0207033}}.
*{{citation |first=M. |last=Jerrum |title=Large cliques elude the Metropolis process |journal=Random Structures and Algorithms |volume=3 |pages=347–359 |year=1992 |doi=10.1002/rsa.3240030402 |issue=4}}.
*{{Citation | last1=Jian | first1=T | title=An {{math|{{italics correction|''O''}}(2<sup>0.304''n''</sup>)}} algorithm for solving maximum independent set problem | publisher=IEEE Computer Society | year=1986 | journal=[[IEEE Transactions on Computers]] | issn=0018-9340 | volume=35 | issue=9 | pages=847–851 | doi=10.1109/TC.1986.1676847}}.
*{{citation |editor1-first=D. S. |editor1-last=Johnson |editor1-link=David S. Johnson |editor2-first=M. A. |editor2-last=Trick |editor2-link=Michael Trick |title=Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11–13, 1993 |series=DIMACS Series in Discrete Mathematics and Theoretical Computer Science |volume=26 |publisher=[[American Mathematical Society]] |url=http://dimacs.rutgers.edu/Volumes/Vol26.html |year=1996 |isbn=0-8218-6609-5 |author=<!-- this comment stops Citation bot adding incorrect info here--> }}.
*{{citation |first1=D. S. |last1=Johnson |author1-link=David S. Johnson |first2=M. |last2=Yannakakis |author2-link=Mihalis Yannakakis |title=On generating all maximal independent sets |journal=[[Information Processing Letters]] |volume=27 |year=1988 |pages=119–123 |issue=3 |doi=10.1016/0020-0190(88)90065-8}}.
*{{citation |last=Karp |first=Richard M. |author-link=Richard M. Karp |url=http://www.cs.berkeley.edu/~luca/cs172/karp.pdf |contribution=Reducibility among combinatorial problems |title=Complexity of Computer Computations |editor1-first=R. E. |editor1-last=Miller |editor2-first=J. W. |editor2-last=Thatcher |publisher=[[Plenum Publishing Corporation|Plenum]] |location=New York |pages=85–103 |year=1972 |access-date=2009-12-17 |archive-date=2011-06-29 |archive-url=https://web.archive.org/web/20110629023717/http://www.cs.berkeley.edu/~luca/cs172/karp.pdf |url-status=dead }}.
*{{citation | last=Karp |first=Richard M. |author-link=Richard M. Karp |contribution=Probabilistic analysis of some combinatorial search problems |title=Algorithms and Complexity: New Directions and Recent Results |editor-first=J. F. |editor-last=Traub |publisher=[[Academic Press]] |location=New York |year=1976 |pages=1–19}}.
*{{citation |first1=K. |last1=Katayama |first2=A. |last2=Hamamoto |first3=H. |last3=Narihisa |title=An effective local search for the maximum clique problem |journal=[[Information Processing Letters]] |volume=95 |issue=5 |year=2005 |pages=503–511 |doi=10.1016/j.ipl.2005.05.010}}.
*{{citation |first=S. |last=Khot |title=Proceedings 42nd IEEE Symposium on Foundations of Computer Science |pages=600–609 |year=2001 |doi=10.1109/SFCS.2001.959936 |chapter=Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring |isbn=0-7695-1116-3|title-link=Symposium on Foundations of Computer Science |s2cid=11987483 }}.
*{{citation |first1=T. |last1=Kloks |first2=D. |last2=Kratsch |first3=H. |last3=Müller |title=Finding and counting small induced subgraphs efficiently |journal=[[Information Processing Letters]] |volume=74 |issue=3–4 |pages=115–121 |year=2000 |doi=10.1016/S0020-0190(00)00047-8}}.
*{{citation |first1=J. |last1=Konc |first2=D. |last2=Janežič |title=An improved branch and bound algorithm for the maximum clique problem |journal=MATCH Communications in Mathematical and in Computer Chemistry |volume=58 |issue=3 |pages=569–590 |year=2007 |url=http://insilab.org/articles/match2007.pdf }}. [http://insilab.org/maxclique Source code]
*{{citation |first1=F. S. |last1=Kuhl |first2=G. M. |last2=Crippen |first3=D. K. |last3=Friesen |year=1983 |title=A combinatorial algorithm for calculating ligand binding |journal=Journal of Computational Chemistry |doi=10.1002/jcc.540050105 |volume=5 |issue=1 |pages=24–34|s2cid=122923018 }}.
*{{Citation | last1=Lagarias | first1=Jeffrey C. | author1-link=Jeffrey Lagarias | last2=Shor |author2-link=Peter Shor| first2=Peter W. | title=Keller's cube-tiling conjecture is false in high dimensions | doi=10.1090/S0273-0979-1992-00318-X | mr = 1155280 | year=1992 | journal=[[Bulletin of the American Mathematical Society]] | series = New Series | volume=27 | issue=2 | pages=279–283| arxiv=math/9210222 | s2cid=6390600 }}.
*{{citation |last1=Lipton |first1=R. J. |author1-link=Richard J. Lipton |last2=Tarjan |first2=R. E. |author2-link=Robert Tarjan |title=Applications of a planar separator theorem |journal=[[SIAM Journal on Computing]] |volume=9 |issue=3 |pages=615–627 |year=1980 |doi=10.1137/0209046|s2cid=12961628 }}.
*{{citation
 | last1 = Liu
 | first1 = Yu
 | last2 = Lu
 | first2 = Jiaheng
 | last3 = Yang
 | first3 = Hua
 | last4 = Xiao
 | first4 = Xiaokui
 | last5 = Wei
 | first5 = Zhewei
 | contribution = Towards maximum independent sets on massive graphs
 | year = 2015
 | doi = 10.14778/2831360.2831366
 | issue = 13
 | pages = 2122–2133
 | series = Proceedings of the VLDB Endowment
 | title = Proceedings of the 41st International Conference on Very Large Data Bases (VLDB 2015)
 | volume = 8
 | hdl = 10138/157292
 | url = http://www.vldb.org/pvldb/vol8/p2122-lu.pdf
 | hdl-access = free
 }}.
*{{citation | last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce | last2 = Perry | first2 = Albert D. | title = A method of matrix analysis of group structure | journal = Psychometrika | volume = 14 | issue = 2 | year = 1949 | pages = 95–116 | doi = 10.1007/BF02289146 | pmid = 18152948| s2cid = 16186758 | hdl = 10.1007/BF02289146 | hdl-access = free }}.
*{{Citation | last1=Mackey | first1=John | title=A cube tiling of dimension eight with no facesharing | doi=10.1007/s00454-002-2801-9 | mr = 1920144 | year=2002 | journal=[[Discrete and Computational Geometry]] | volume=28 | issue=2 | pages=275–279| doi-access=free }}.
*{{citation | last1 = Magniez | first1 = Frédéric | last2 = Santha | first2 = Miklos | last3 = Szegedy | first3 = Mario | author-link3 = Mario Szegedy | title = Quantum algorithms for the triangle problem | year = 2007 | arxiv = quant-ph/0310134 | journal = [[SIAM Journal on Computing]] | volume = 37 | issue = 2 | pages = 413–424 | doi = 10.1137/050643684| s2cid = 594494 }}.
*{{citation |first1=K. |last1=Makino |first2=T. |last2=Uno |contribution=New algorithms for enumerating all maximal cliques |title=Algorithm Theory: SWAT 2004 |series=Lecture Notes in Computer Science |publisher=[[Springer-Verlag]] |volume=3111 |year=2004 |pages=260–272 |doi=10.1007/978-3-540-27810-8_23 |isbn=978-3-540-22339-9 |citeseerx=10.1.1.138.705 |url=http://research.nii.ac.jp/~uno/papers/04swat.pdf }}.
*{{citation
 | last1 = Meka | first1 = Raghu
 | last2 = Potechin | first2 = Aaron
 | last3 = Wigderson | first3 = Avi | author3-link = Avi Wigderson
 | arxiv = 1503.06447
 | contribution = Sum-of-squares lower bounds for planted clique
 | doi = 10.1145/2746539.2746600
 | isbn = 978-1-4503-3536-2
 | location = New York, NY, USA
 | pages = 87–96
 | publisher = ACM
 | title = Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC '15)
 | year = 2015| s2cid = 2754095
 }}.
*{{citation | last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L. | title = On cliques in graphs | journal = [[Israel Journal of Mathematics]] | volume = 3 | year = 1965 | pages = 23–28 | mr = 0182577 | doi = 10.1007/BF02760024 | doi-access=free | s2cid = 9855414 }}.
*{{citation |author1-link=Jaroslav Nešetřil |first1=J. |last1=Nešetřil |first2=S. |last2=Poljak |title=On the complexity of the subgraph problem |journal=Commentationes Mathematicae Universitatis Carolinae |volume=26 |issue=2 |pages=415–419 |year=1985}}.
*{{citation |first=P. R. J. |last=Östergård |title=A fast algorithm for the maximum clique problem |journal=[[Discrete Applied Mathematics]] |volume=120 |issue=1–3 |year=2002 |pages=197–207 |doi=10.1016/S0166-218X(01)00290-6|doi-access=free }}.
*{{citation |last1=Ouyang |first1=Q. |last2=Kaplan |first2=P. D. |last3=Liu |first3=S. |last4=Libchaber |first4=A. |title=DNA solution of the maximal clique problem |journal=[[Science (journal)|Science]] |volume=278 |issue=5337 |pages=446–449 |pmid=9334300 |doi=10.1126/science.278.5337.446 |year=1997|bibcode=1997Sci...278..446O }}.
*{{citation
 | last1 = Papadimitriou | first1 = Christos H. | author1-link = Christos Papadimitriou
 | last2 = Yannakakis | first2 = Mihalis | author2-link = Mihalis Yannakakis
 | doi = 10.1016/0020-0190(81)90041-7
 | issue = 4–5
 | journal = [[Information Processing Letters]]
 | mr = 651460
 | pages = 131–133
 | title = The clique problem for planar graphs
 | volume = 13
 | year = 1981}}.
*{{citation |last1=Pardalos |first1=P. M. |last2=Rogers |first2=G. P. |title=A branch and bound algorithm for the maximum clique problem |journal=Computers & Operations Research |year=1992 |volume=19 |issue=5 |pages=363–375 |doi=10.1016/0305-0548(92)90067-F}}.
*{{citation |first=A. A. |last=Razborov |author-link=Alexander Razborov |title=Lower bounds for the monotone complexity of some Boolean functions |language=ru |journal=[[Proceedings of the USSR Academy of Sciences]] |volume=281 |year=1985 |pages=798–801 |postscript=. English translation in ''Sov. Math. Dokl.'' '''31''' (1985): 354–357}}.
*{{citation |first=J.-C. |last=Régin |contribution=Using constraint programming to solve the maximum clique problem |title=Proc. 9th Int. Conf. Principles and Practice of Constraint Programming – CP 2003 |year=2003 |doi=10.1007/978-3-540-45193-8_43 |series=Lecture Notes in Computer Science |publisher=[[Springer-Verlag]] |volume=2833 |pages=634–648|isbn=978-3-540-20202-8 }}.
*{{citation |first1=Nicholas |last1=Rhodes |first2=Peter |last2=Willett |first3=Alain |last3=Calvet |first4=James B. |last4=Dunbar |first5=Christine |last5=Humblet |journal=Journal of Chemical Information and Computer Sciences |volume=43 |issue=2 |pages=443–448 |year=2003 |doi=10.1021/ci025605o |pmid=12653507 |title=CLIP: similarity searching of 3D databases using clique detection}}.
*{{citation |first=J. M. |last=Robson |title=Algorithms for maximum independent sets |journal=Journal of Algorithms |volume=7 |year=1986 |pages=425–440 |issue=3 |doi=10.1016/0196-6774(86)90032-5}}.
*{{Citation | last1=Robson | first1=J. M. | title=Finding a maximum independent set in time ''{{math|{{italics correction|''O''}}(2<sup>''n''/4</sup>)}}'' | year=2001 | url=http://www.labri.fr/perso/robson/mis/techrep.html }}.
*{{citation |last1=Rosgen |first1=B |last2=Stewart |first2=L |year=2007 |title=Complexity results on graphs with few cliques |journal=Discrete Mathematics and Theoretical Computer Science |volume=9 |issue=1 |pages=127–136 |url=https://hal.inria.fr/hal-00966509 }}.
*{{citation |first1=Ram |last1=Samudrala |first2=John |last2=Moult |title=A graph-theoretic algorithm for comparative modeling of protein structure |journal=Journal of Molecular Biology |volume=279 |issue=1 |year=1998 |pages=287–302 |doi=10.1006/jmbi.1998.1689 |pmid=9636717}}.
*{{citation
 | last1 = Sethuraman | first1 = Samyukta
 | last2 = Butenko | first2 = Sergiy
 | doi = 10.1007/s10287-013-0197-z
 | issue = 1
 | journal = Computational Management Science
 | mr = 3296231
 | pages = 197–218
 | title = The maximum ratio clique problem
 | volume = 12
 | year = 2015| s2cid = 46153055
 }}.
*{{citation |first1=Y. |last1=Song |title=On the independent set problem in random graphs |journal=International Journal of Computer Mathematics |volume=92 |issue=11 |year=2015 |pages=2233–2242 |doi=10.1080/00207160.2014.976210 |s2cid=6713201 |url=https://zenodo.org/record/896067 }}.
*{{citation |first1=Victor |last1=Spirin |first2=Leonid A. |last2=Mirny |title=Protein complexes and functional modules in molecular networks |journal=[[Proceedings of the National Academy of Sciences]] |volume=100 |issue=21 |pages=12123–12128 |doi=10.1073/pnas.2032324100 |year=2003 |pmid=14517352 |pmc=218723|bibcode=2003PNAS..10012123S |doi-access=free }}.
*{{citation |first1=R. E. |last1=Tarjan |author1-link=Robert Tarjan |first2=A. E. |last2=Trojanowski |title=Finding a maximum independent set |journal=[[SIAM Journal on Computing]] |volume=6 |year=1977 |pages=537–546 |url=http://i.stanford.edu/pub/cstr/reports/cs/tr/76/550/CS-TR-76-550.pdf |doi=10.1137/0206038 |issue=3 }}.
*{{citation |first1=E. |last1=Tomita |first2=T. |last2=Kameda |title=An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |journal=Journal of Global Optimization |volume=37 |issue=1 |year=2007 |pages=95–111 |doi=10.1007/s10898-006-9039-7|s2cid=21436014 }}.
*{{citation |first1=E. |last1=Tomita |first2=T. |last2=Seki |title=Discrete Mathematics and Theoretical Computer Science |series=Lecture Notes in Computer Science |publisher=Springer-Verlag |volume=2731 |year=2003 |pages=[https://archive.org/details/discretemathemat0000dmtc/page/278 278–289] |doi=10.1007/3-540-45066-1_22 |chapter=An efficient branch-and-bound algorithm for finding a maximum clique |isbn=978-3-540-40505-4 |s2cid=21436014 |chapter-url=https://archive.org/details/discretemathemat0000dmtc/page/278 }}.
*{{citation |first1=E. |last1=Tomita |first2=A. |last2=Tanaka |first3=H. |last3=Takahashi |title=The worst-case time complexity for generating all maximal cliques and computational experiments |journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] |volume=363 |issue=1 |pages=28–42 |year=2006 |doi=10.1016/j.tcs.2006.06.015|doi-access=free }}.
*{{citation |first1=S. |last1=Tsukiyama |first2=M. |last2=Ide |first3=I. |last3=Ariyoshi |first4=I. |last4=Shirakawa |title=A new algorithm for generating all the maximal independent sets |journal=[[SIAM Journal on Computing]] |volume=6 |year=1977 |pages=505–517 |doi=10.1137/0206036 |issue=3}}.
*{{citation |last=Valiant |first=L. G. |title=Proc. 15th ACM Symposium on Theory of Computing |year=1983 |pages=110–117 |doi=10.1145/800061.808739 |chapter=Exponential lower bounds for restricted monotone circuits |isbn=0-89791-099-0|title-link=Symposium on Theory of Computing |s2cid=6326587 }}.
*{{citation |first1=V. |last1=Vassilevska|author1-link= Virginia Vassilevska Williams |first2=R. |last2=Williams |author2-link=Ryan Williams (computer scientist) |title=Proc. 41st ACM Symposium on Theory of Computing |year=2009 |pages=455–464 |doi=10.1145/1536414.1536477 |chapter=Finding, minimizing, and counting weighted subgraphs |isbn=978-1-60558-506-2|citeseerx=10.1.1.156.345 |title-link=Symposium on Theory of Computing|s2cid=224579}}.
*{{citation |last=Wegener |first=I. |title=On the complexity of branching programs and decision trees for clique functions |journal=[[Journal of the ACM]] |volume=35 |issue=2 |pages=461–472 |year=1988 |doi=10.1145/42282.46161|s2cid=11967153 |doi-access=free }}.
*{{citation |first=R. |last=Yuster  | author-link = Raphael Yuster|title=Finding and counting cliques and independent sets in ''r''-uniform hypergraphs |journal=[[Information Processing Letters]] |volume=99 |issue=4 |pages=130–134 |year=2006 |doi=10.1016/j.ipl.2006.04.005}}.
*{{citation |first=D. |last=Zuckerman |title=Proc. 38th ACM Symp. Theory of Computing |pages=681–690 |year=2006 |doi=10.1145/1132516.1132612 |id={{ECCC|2005|05|100}}|chapter=Linear degree extractors and the inapproximability of max clique and chromatic number |isbn=1-59593-134-1|title-link=Symposium on Theory of Computing |s2cid=5713815 }}.
{{refend}}

[[Category:NP-complete problems]]
[[Category:Computational problems in graph theory]]