An Improved Ant Colony Optimization for the Maximum Clique Problem

Authors:
Xinshun Xu;Jun Ma;Jingsheng Lei
Affiliations:
Shandong University, China;Shandong University, China;Hainan University, China
Venue:
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Year:
2007

Citing 0
Cited 3

Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph

Fundamenta Informaticae
A framework for attack patterns' discovery in honeynet data

Digital Investigation: The International Journal of Digital Forensics & Incident Response
Finding a Maximum Clique Using Ant Colony Optimization and Particle Swarm Optimization in Social Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The maximum clique problem is a classical combinatorial optimization problem which is one of the first problems shown to be NP-Complete. Moreover, it does not admit a polynomial-time approximation algorithm unless P=NP. So many heuristic algorithms have been proposed for this problem. In this paper, we introduce an improved ant colony optimization (ACO) for the maximum clique problem. In the proposed algorithm, both a new pheromone updating method and a parameter tuning method are introduced. Simulations are performed on some graphs of the DIMACS clique instances in the second DIMACS challenge. The results show that the improved ant colony optimization can yield satisfactory results.