Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
