突出图中最大聚类的递归算法

S. V. Kurapov
{"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}
引用次数: 0

摘要

这项工作考虑了计算非定向图最大簇的多项式算法。该算法基于属于非定向图空间 sugrapha 的部分子空间和循环子空间的特性。结果表明,分配图的最大点击集的算法具有指数级的计算复杂性。还考虑了突出图的最大簇的例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信