ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 2. Vol. 30. 2024

DOI: 10.17587/it.30.68-75

S. V. Kurapov, Ph. D., Associate Professor,
Zaporizhzhya National University, Zaporizhzhya

Recursion Algorithm for Highlighting the Maximum Clique of the Graph

The work considers the polynomial algorithm for calculating the maximum clique of the non orientable graph. The algorithm is based on the properties of the subspace of sections and the subspace of cycles belonging to the the space sugrapha of a non — unoriented graph. It is shown that the algorithm for the allocation of the set of maximum clicks of the graph has an exponential computational complexity. Examples of highlighting the maximum clique of the graph are considered.
Keywords: non orientable graph, click, cycle, sugraph, subgraph

P. 68-75

References

1. Aho H., Hopcroft J., Ullman J. The Design and analysis of computer algorithms, Moscow, Mir, 1979, 536 p. (in Russian).
2. Garey M. R., Johnson D. S. Computers and Intractability: a Gulde to the Theory of NP-Completeness, New York, 1990.
3. Emelichev V. A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I. Lectures on Graph Theory, Moscow, Nauka, 1990, 384 p. (in Russian).
4. Zykov À. À . Theory of Finite Graphs, Novosibirsk, Nauka, 1963, 542 p. (in Russian).
5. Zykov À. À . Foundations of Graph Theory, Moscow, Nauka, 1986, 384 p. (in Russian).
6. Karp R. M. Reducibility among Combinatorial problems, Complexity of computer computations, Proc. Symp, March 20—22, 1972, pp. 85—103.
7. Knuth D. The art of computer programming, volume 4, A. Combinatorial algorithms, Moscow, Williams, 2013, 960 p.
8. Cook S. A. The complexity of theorem-proving procedure, Proc. 3d Annual ACM Symposium on the Theory of Computing, Ohio, 1971, pp. 151—159.
9. Swamy M. T. S., Thulasiraman K. Graphs, Networks, and Algorithms, J. Wiley & Sons, 1981.

To the contents