### Abstract

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 graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The algorithm was designed so that it can be easily implemented in a distributed system. One such implementation is also described in the paper. For 22 of the 30 graphs tested ASMC found the optimal solution. For the remaining graphs ASMC produced solutions that are within 16% of the optimal, with most being within 8% of the optimal. The performance of ASMC is comparable to existing algorithms.

Original language | English (US) |
---|---|

Pages (from-to) | 24-35 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 3102 |

State | Published - Dec 1 2004 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)