NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem

The maximum quasi-clique problem (MQCP) is an important extension of maximum clique problem with wide applications. Recent heuristic MQCP algorithms can hardly solve large and hard graphs effectively. This paper develops an efficient local search algorithm named NuQClq for the MQCP, which has two main ideas. First, we propose a novel vertex selection strategy, which utilizes cumulative saturation information to be a selection criterion when the candidate vertices have equal values on the primary scoring function. Second, a variant of configuration checking named BoundedCC is designed by setting an upper bound for the threshold of forbidding strength. When the threshold value of vertex exceeds the upper bound, we reset its threshold value to increase the diversity of search process. Experiments on a broad range of classic benchmarks and sparse instances show that NuQ- Clq significantly outperforms the state-of-the-art MQCP algorithms for most instances.

Authors

• Jiejiang Chen
• Shaowei Cai Institute of Software, Chinese Academy of Sciences
• Shiwei Pan
• Yiyuan Wang Northeast Normal University
• Qingwei Lin Microsoft Research
• Mengyu Zhao
• Minghao Yin

Keywords

No keywords are indexed for this paper.