117
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...