PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

An improvement of the ant algorithm for the maximum clique problem

Content
Title variants
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.
Publisher
Year
-
Physical description
Dates
online
2016-02-17
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2016-article-5723
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.