- Tytuł:
- An Ant Algorithm for the Maximum Clique Problem in a Special Kind of Graph
- Autorzy:
- Schiff, K.
- Powiązania:
- https://bibliotekanauki.pl/articles/384647.pdf
- Data publikacji:
- 2015
- Wydawca:
- Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
- Tematy:
-
ant algorithm
maximum clique problem - Opis:
- The maximum clique problem is a very well-known NP-complete problem of the kind for which meta-heuristic algorithms, which include ant algorithms, have been developed. Well-known instances of problems enable the assessment of the quality of elaborated algorithms; however, there is a particular kind of graph in which each vertex has a nearly equal number of adjacent edges. It is very difficult to find a maximum clique in such a graph. The search for the maximum clique in this particular kind of graph is investigated and compared to the best known ant algorithms.
- Źródło:
-
Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 2; 20-23
1897-8649
2080-2145 - Pojawia się w:
- Journal of Automation Mobile Robotics and Intelligent Systems
- Dostawca treści:
- Biblioteka Nauki
Artykuł