#### Date of Award

8-2010

#### Degree Type

Dissertation

#### Degree Name

Doctor of Philosophy

#### Major

Computer Science

#### Major Professor

Michael A. Langston

#### Committee Members

Michael W. Berry, Lynne E. Parker, Arnold M. Saxton

#### Abstract

Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily tuned for different types of input data. This general and modifiable approach is also meant as a tool for research so that different strategies can easily be tried for different situations. Next, a specific implementation is described. The program is tuned, by use of experiments, to work best for two different graph types, real-world biological data and a suite of synthetic graphs. A parallel implementation is then briefly discussed and tested. After considering implementation, an example of applying these clique-finding tools to a specific case of real-world biological data is presented. Results are analyzed using both statistical and biological metrics. Then the development of practical algorithms based on clique-finding tools is explored in greater detail. New algorithms are introduced and preliminary experiments are performed. Next, some relaxations of clique are discussed along with the possibility of developing new practical algorithms from these variations. Finally, conclusions and future research directions are given.

#### Recommended Citation

Eblen, John David, "The Maximum Clique Problem: Algorithms, Applications, and Implementations. " PhD diss., University of Tennessee, 2010.

http://trace.tennessee.edu/utk_graddiss/793

*LaTeX source files, BibTeX references, images, and template*

#### Included in

Bioinformatics Commons, Computational Biology Commons, Discrete Mathematics and Combinatorics Commons, Software Engineering Commons, Theory and Algorithms Commons