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.
No takes yet. Share an insight, caveat, or question.
S. V. Kurapov (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: