Штучний інтелект

Анотація: This paper presents a method of finding the set of maximal cliques in a graph. This method is based on the method for constructing complementary graph-pyramid that makes it easy to parallelize computations. The computational complexity of the given method linearly depends on number ofmaximal cliques in a graph. For specific tasks (for example, image recognition) this method stimulates solutions. This is achieved by reducing number of constructed vertices and edges by the additional conditions in their construction, which take into account characteristics of the tasks.

Ключові слова:

Посилання:

1. Ahmadyfard A. British Machine Vision Conference. 2000. P. 745-754.
2. Kailing K. Proc. 8th Int. Conf. on Knowledge-Based Intelligent and Engineering System. Wellington,New Zealand. 2004. LNAI 3214. P. 982-988.
3. Feng Tang. 2nd Joint IEEE International Workshop on Visual Surveillance and Performance Evaluationof Tracking and Surveillance. 2005. P. 25-32.
4. Agarkov A.V. Bionika intellekta. №.1 (70). 2009. S. 95-101
5. Agarkov A.V. Iskusstvennyj intellekt. № 3. 2010 S. 274-282.
6. Bron C. Finding all cliques of an undirected graph, Comm. of ACM. 16. P. 575.
7. Agarkov A.V. Iskusstvennyj intellekt. № 4. 2003. S. 172-184.
8. Agarkov A.V. Iskusstvennyj intellekt. № 2. 2007. S. 62-74.