An improvement of the ant algorithm for the maximum clique problem

• Authors: Krzysztof Schiff
• Languages of publication: PL

Abstracts

PL

The maximum clique problem is a very well-known NP-complete problem and for such a problem, meta-heuristic algorithms have been developed which ant algorithms belongs to. There are many algorithms including ant algorithms that have been elaborated for this problem. In this paper, a new dynamic function of selecting with a new improvement procedure in order to get a larger size of clique for the ant algorithm is presented and this search for the maximum clique in graph is compared to the bestn ant algorithms that are already known.

Keywords

PL

maximum clique, ant algorithm, desirability function

• Publisher: [unknown2]
• Journal: Czasopismo Techniczne
• Year: -

Dates

online

2016-02-17

Contributors

author

Krzysztof Schiff