An improved branch and bound algorithm for the maximum clique problem

By Janez Konc, Dusanka Janezic. 2007

285 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/5957f43dc0bc3d85bfc3297dbcf7ae8ae8c94b46

Citations in the corpus

• Global organization of a binding site network gives insight into evolution and structure-function relationships of proteins (2017, unknown): “From the generated product graph, we detected its maximum clique 2, 65 , i.e., the largest complete sub-graph of a graph where all vertices are connected to each other.”
• A review on algorithms for maximum clique problems (2015, unknown): “The results of Cliquer, CPR, MaxCliqueDyn, MCR and Max-CLQ are directly extracted from Li & Quan (2010), while the results of χ + DF , MCS, BBclique and ILS&MaxCLQ are taken from the papers describing these algorithms and the results of MCQ are obtained from Konc & Janeˇziˇc (2007).”