Dynamic Local Search for the Maximum Clique Problem

Abstract

In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, during which vertices of the current clique are swapped with vertices not contained in the current clique. The selection of vertices is solely based on vertex penalties that are dynamically adjusted during the search, and a perturbation mechanism is used to overcome search stagnation. The behaviour of DLS-MC is controlled by a single parameter, penalty delay, which controls the frequency at which vertex penalties are reduced. We show empirically that DLS-MC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.

References in corpus (1)

• Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search

Cited by in corpus (8)

• Molecular Docking with Gaussian Boson Sampling
• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
• Applications of Near-Term Photonic Quantum Computers: Software and Algorithms
• Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling
• Circuit Design for Clique Problem and Its Implementation on Quantum Computer
• The First Hardware Demonstration of a Universal Programmable RRAM-based Probabilistic Computer for Molecular Docking
• Graph Partitioning for Independent Sets
• Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices