{"title":"突出图中最大聚类的递归算法","authors":"S. V. Kurapov","doi":"10.17587/it.30.68-75","DOIUrl":null,"url":null,"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.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recursion Algorithm for Highlighting the Maximum Clique of the Graph\",\"authors\":\"S. V. Kurapov\",\"doi\":\"10.17587/it.30.68-75\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":504905,\"journal\":{\"name\":\"Informacionnye Tehnologii\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informacionnye Tehnologii\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17587/it.30.68-75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informacionnye Tehnologii","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17587/it.30.68-75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
