\relax 
\citation{washington,san2011exact}
\citation{ryanrossi}
\citation{nvidiawebsite}
\@writefile{toc}{\contentsline {chapter}{Hamiltonian Mechanics}{0}}
\@writefile{toc}{\contentsline {title}{Maximum Clique Solver using Bitsets on GPUs}{I}}
\@writefile{toc}{\authcount {3}}
\@writefile{toc}{\contentsline {author}{Matthew VanCompernolle\unskip {} \and Lee Barford\unskip {} \and Frederick Harris, Jr.\unskip {}}{I}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{I}}
\citation{tomita2007efficient}
\citation{san2011exact,tomita2007efficient,prosser2012exact,tomita2003efficient}
\citation{san2013improved,san2013robust,san2011exact,san2014relaxed}
\@writefile{toc}{\contentsline {section}{\numberline {2}Background}{II}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Basic Maximum Clique Algorithm:}{II}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Approximate Coloring:}{II}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Bitset Representations and BBMC:}{II}}
\citation{rossi2013parallel}
\citation{mccreesh2013multi}
\citation{cruz2013parallelizing}
\citation{mccreesh2013multi}
\citation{prosser2012exact,san2011exact,san2010fast}
\@writefile{toc}{\contentsline {paragraph}{\bf  Parallel MCP Algorithms:}{III}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Parallel GPU Implementation}{III}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Parallel Method:}{III}}
\citation{cruz2013parallelizing}
\citation{cruz2013parallelizing}
\@writefile{toc}{\contentsline {paragraph}{\bf  Memory Allocation and Management: }{IV}}
\citation{prosser2012exact}
\@writefile{toc}{\contentsline {paragraph}{\bf  Preprocessing and Post-processing:}{V}}
\citation{johnson1996cliques}
\@writefile{toc}{\contentsline {section}{\numberline {4}Results and Discussion}{VI}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Sequential Implementation and Test Environment: }{VI}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Results:}{VI}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Growth rate of BBMC and BBMCG run times with respect to graph density on randomly generated graphs with 200 vertices.}}{VII}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{fig_edge_probability}{{1}{VII}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Growth rate of BBMC and BBMCG run times with respect to graph size on randomly generated graphs with 0.5 edge probability.}}{VII}}
\newlabel{fig_graph_size}{{2}{VII}}
\@writefile{toc}{\contentsline {paragraph}{\bf  Analysis:}{VII}}
\bibstyle{./splncs03}
\bibdata{./paper}
\bibcite{cruz2013parallelizing}{1}
\@writefile{toc}{\contentsline {section}{\numberline {5}Conclusions and Future Work}{IX}}
\bibcite{washington}{2}
\bibcite{johnson1996cliques}{3}
\bibcite{mccreesh2013multi}{4}
\bibcite{nvidiawebsite}{5}
\bibcite{prosser2012exact}{6}
\bibcite{rossi2013parallel}{7}
\bibcite{ryanrossi}{8}
\bibcite{san2013improved}{9}
\bibcite{san2013robust}{10}
\bibcite{san2011exact}{11}
\bibcite{san2010fast}{12}
\bibcite{san2014relaxed}{13}
\bibcite{tomita2007efficient}{14}
\bibcite{tomita2003efficient}{15}
\bibcite{trefftz2014parallelizing}{16}
\bibcite{xiang2013scalable}{17}