论文信息 - An improved branch and bound algorithm for the maximum clique problem

An improved branch and bound algorithm for the maximum clique problem

A new algorithm for finding a maximum clique in an undirected graph is described. An approximate coloring algorithm has been improved and used to provide bounds to the size of the maximum clique in a basic algorithm which finds a maximum clique. This basic algorithm was then extended to include dynamically varying bounds. The resulting algorithm is significantly faster than the comparable algorithm.

Janez Konc | D. Janežič

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .

[3] David R. Wood,et al. An algorithm for finding a maximum clique in a graph , 1997, Oper. Res. Lett..

[4] G. Klebe,et al. A new method to detect related function among proteins independent of sequence and fold homology. , 2002, Journal of molecular biology.

[5] Patric R. J. Östergård,et al. A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[6] Etsuji Tomita,et al. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique , 2003, DMTCS.

[7] Christian Hofbauer,et al. SURFCOMP: A Novel Graph-Based Approach to Molecular Surface Comparison , 2004, J. Chem. Inf. Model..

[8] Egon Balas,et al. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring , 1996, Algorithmica.

[9] Wilbert E. Wilhelm,et al. Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..

[10] Dusanka Janezic,et al. A Branch and Bound Algorithm for Matching Protein Structures , 2007, ICANNGA.

[11] Dusanka Janezic,et al. Protein-Protein Binding-Sites Prediction by Protein Surface Structure Conservation , 2007, J. Chem. Inf. Model..