\begin{thebibliography}{10}
\providecommand{\url}[1]{\texttt{#1}}
\providecommand{\urlprefix}{URL }

\bibitem{cruz2013parallelizing}
Cruz, R., Lopez, N., Trefftz, C.: Parallelizing a heuristic for the maximum
  clique problem on gpus and clusters of workstations. In: Electro/Information
  Technology (EIT), 2013 IEEE International Conference on. pp. 1--6. IEEE
  (2013)

\bibitem{washington}
Howbert, J.J., Roberts, J.: The maximum clique problem (2007),
  \url{http://courses.cs.washington.edu/courses/csep521/07wi/prj/jeff{\_}jacki%
.pdf}, accessed: 2015-05-09

\bibitem{johnson1996cliques}
Johnson, D., Trick, M.: Cliques, coloring, and satisfiability, dimacs series in
  disc. Math. and Theoret. Comput. Sci  26 (1996)

\bibitem{mccreesh2013multi}
McCreesh, C., Prosser, P.: Multi-threading a state-of-the-art maximum clique
  algorithm. Algorithms  6(4),  618--635 (2013)

\bibitem{nvidiawebsite}
NVIDIA{\ }Corporation: Cuda c programming guide (2015),
  \url{http://docs.nvidia.com/cuda/cuda-c-programming-guide/}, accessed:
  2015-05-09

\bibitem{prosser2012exact}
Prosser, P.: Exact algorithms for maximum clique: A computational study.
  Algorithms  5(4),  545--587 (2012)

\bibitem{rossi2013parallel}
Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M., Ali, M.: Parallel
  maximum clique algorithms with applications to network analysis and storage.
  arXiv preprint arXiv:1302.6256  (2013)

\bibitem{ryanrossi}
Rossi, R.A., Gleich, D.F., Gebremedhin, A.H., Patwary, M.M.A.: A fast parallel
  maximum clique algorithm for large sparse graphs and temporal strong
  components. CoRR  abs/1302.6256 (2013), \url{http://arxiv.org/abs/1302.6256}

\bibitem{san2013improved}
San~Segundo, P., Matia, F., Rodriguez-Losada, D., Hernando, M.: An improved bit
  parallel exact maximum clique algorithm. Optimization Letters  7(3),
  467--479 (2013)

\bibitem{san2013robust}
San~Segundo, P., Rodriguez-Losada, D.: Robust global feature based data
  association with a sparse bit optimized maximum clique algorithm. Robotics,
  IEEE Transactions on  29(5),  1332--1339 (2013)

\bibitem{san2011exact}
San~Segundo, P., Rodr{\'\i}guez-Losada, D., Jim{\'e}nez, A.: An exact
  bit-parallel algorithm for the maximum clique problem. Computers \&
  Operations Research  38(2),  571--581 (2011)

\bibitem{san2010fast}
San~Segundo, P., Rodr{\'\i}guez-Losada, D., Mat{\'\i}a, F., Gal{\'a}n, R.: Fast
  exact feature based data correspondence search with an efficient bit-parallel
  mcp solver. Applied Intelligence  32(3),  311--329 (2010)

\bibitem{san2014relaxed}
San~Segundo, P., Tapia, C.: Relaxed approximate coloring in exact maximum
  clique search. Computers \& Operations Research  44,  185--192 (2014)

\bibitem{tomita2007efficient}
Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a
  maximum clique with computational experiments. Journal of Global Optimization
   37(1),  95--111 (2007)

\bibitem{tomita2003efficient}
Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a
  maximum clique. In: Discrete mathematics and theoretical computer science,
  pp. 278--289. Springer (2003)

\bibitem{trefftz2014parallelizing}
Trefftz, C., Santamaria-Galvis, A., Cruz, R.: Parallelizing an algorithm to
  find the maximal clique on interval graphs on graphical processing units. In:
  Electro/Information Technology (EIT), 2014 IEEE International Conference on.
  pp. 100--102. IEEE (2014)

\bibitem{xiang2013scalable}
Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using
  mapreduce. In: Data Engineering (ICDE), 2013 IEEE 29th International
  Conference on. pp. 74--85. IEEE (2013)

\end{thebibliography}