Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance of Neural Net Heuristics for Maximum Clique on DiverseHighly Compressible Graphs
Journal of Global Optimization
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
On places suitable for applying AI principles in NP-hard graph problems' algorithms
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Artificial intelligence in the maximum clique finding problem applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
A comparison of evolutionary algorithms for finding optimal error-correcting codes
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Evolutionary approaches to the generation of optimal error correcting codes
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
This paper presents some adaptive restart randomized greedy heuristics for MAXIMUM CLIQUE. The algorithms are based on improvements and variations of previously-studied algorithms by the authors. Three kinds of adaptation are studied: adaptation of the initial state (AI) given to the greedy heuristic, adaptation of vertex weights (AW) on the graph, and no adaptation (NA). Two kinds of initialization of the vertex-weights are investigated: unweighted initialization (wi := 1) and degree-based initialization (wi := di where di is the degree of vertex i in the graph). Experiments are conducted on several kinds of graphs (random, structured) with six combinations: {NA, AI, and AW} × {unweighted initialization, degree-based initialization}. A seventh state of the art semi-greedy algorithm, DMclique, is evaluated as a benchmark algorithm. We concentrate on the problem of finding large cliques in large, dense graphs in a relatively short amount of time. We find that the different strategies produce different effects, and that different algorithms work best on different kinds of graphs.