% Generated by IEEEtran.bst, version: 1.12 (2007/01/11)
\begin{thebibliography}{10}
\providecommand{\url}[1]{#1}
\csname url@samestyle\endcsname
\providecommand{\newblock}{\relax}
\providecommand{\bibinfo}[2]{#2}
\providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}
\providecommand{\BIBentryALTinterwordstretchfactor}{4}
\providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus
\BIBentryALTinterwordstretchfactor\fontdimen3\font minus
  \fontdimen4\font\relax}
\providecommand{\BIBforeignlanguage}[2]{{%
\expandafter\ifx\csname l@#1\endcsname\relax
\typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}%
\typeout{** loaded for the language `#1'. Using the pattern for}%
\typeout{** the default language instead.}%
\else
\language=\csname l@#1\endcsname
\fi
#2}}
\providecommand{\BIBdecl}{\relax}
\BIBdecl

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

\bibitem{washington}
\BIBentryALTinterwordspacing
J.~J. Howbert and J.~Roberts. (2007) The maximum clique problem. Accessed:
  2015-05-09. [Online]. Available:
  \url{http://courses.cs.washington.edu/courses/csep521/07wi/prj/jeff{\_}jacki.pdf}
\BIBentrySTDinterwordspacing

\bibitem{ryanrossi}
\BIBentryALTinterwordspacing
R.~A. Rossi, D.~F. Gleich, A.~H. Gebremedhin, and M.~M.~A. Patwary, ``A fast
  parallel maximum clique algorithm for large sparse graphs and temporal strong
  components,'' \emph{CoRR}, vol. abs/1302.6256, 2013. [Online]. Available:
  \url{http://arxiv.org/abs/1302.6256}
\BIBentrySTDinterwordspacing

\bibitem{nvidiawebsite}
\BIBentryALTinterwordspacing
NVIDIA{\ }Corporation. (2015) Cuda c programming guide. Accessed: 2015-05-09.
  [Online]. Available:
  \url{http://docs.nvidia.com/cuda/cuda-c-programming-guide/}
\BIBentrySTDinterwordspacing

\bibitem{tomita2007efficient}
E.~Tomita and T.~Kameda, ``An efficient branch-and-bound algorithm for finding
  a maximum clique with computational experiments,'' \emph{Journal of Global
  Optimization}, vol.~37, no.~1, pp. 95--111, 2007.

\bibitem{prosser2012exact}
P.~Prosser, ``Exact algorithms for maximum clique: A computational study,''
  \emph{Algorithms}, vol.~5, no.~4, pp. 545--587, 2012.

\bibitem{tomita2003efficient}
E.~Tomita and T.~Seki, ``An efficient branch-and-bound algorithm for finding a
  maximum clique,'' in \emph{Discrete mathematics and theoretical computer
  science}.\hskip 1em plus 0.5em minus 0.4em\relax Springer, 2003, pp.
  278--289.

\bibitem{san2014relaxed}
P.~San~Segundo and C.~Tapia, ``Relaxed approximate coloring in exact maximum
  clique search,'' \emph{Computers \& Operations Research}, vol.~44, pp.
  185--192, 2014.

\bibitem{san2013improved}
P.~San~Segundo, F.~Matia, D.~Rodriguez-Losada, and M.~Hernando, ``An improved
  bit parallel exact maximum clique algorithm,'' \emph{Optimization Letters},
  vol.~7, no.~3, pp. 467--479, 2013.

\bibitem{san2013robust}
P.~San~Segundo and D.~Rodriguez-Losada, ``Robust global feature based data
  association with a sparse bit optimized maximum clique algorithm,''
  \emph{Robotics, IEEE Transactions on}, vol.~29, no.~5, pp. 1332--1339, 2013.

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

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

\bibitem{mccreesh2013multi}
C.~McCreesh and P.~Prosser, ``Multi-threading a state-of-the-art maximum clique
  algorithm,'' \emph{Algorithms}, vol.~6, no.~4, pp. 618--635, 2013.

\bibitem{cruz2013parallelizing}
R.~Cruz, N.~Lopez, and C.~Trefftz, ``Parallelizing a heuristic for the maximum
  clique problem on gpus and clusters of workstations,'' in
  \emph{Electro/Information Technology (EIT), 2013 IEEE International
  Conference on}.\hskip 1em plus 0.5em minus 0.4em\relax IEEE, 2013, pp. 1--6.

\bibitem{xiang2013scalable}
J.~Xiang, C.~Guo, and A.~Aboulnaga, ``Scalable maximum clique computation using
  mapreduce,'' in \emph{Data Engineering (ICDE), 2013 IEEE 29th International
  Conference on}.\hskip 1em plus 0.5em minus 0.4em\relax IEEE, 2013, pp.
  74--85.

\bibitem{trefftz2014parallelizing}
C.~Trefftz, A.~Santamaria-Galvis, and R.~Cruz, ``Parallelizing an algorithm to
  find the maximal clique on interval graphs on graphical processing units,''
  in \emph{Electro/Information Technology (EIT), 2014 IEEE International
  Conference on}.\hskip 1em plus 0.5em minus 0.4em\relax IEEE, 2014, pp.
  100--102.

\bibitem{johnson1996cliques}
D.~Johnson and M.~Trick, ``Cliques, coloring, and satisfiability, dimacs series
  in disc,'' \emph{Math. and Theoret. Comput. Sci}, vol.~26, 1996.

\end{thebibliography}