Exact Parallel Maximum Clique Algorithm for General and Protein Graphs

@article{Depolli2013ExactPM,
  title={Exact Parallel Maximum Clique Algorithm for General and Protein Graphs},
  author={Matjaz Depolli and Janez Konc and Kati Rozman and Roman Trobec and Dusanka Janezic},
  journal={Journal of chemical information and modeling},
  year={2013},
  volume={53 9},
  pages={2217-28}
}
A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…