图论中最大独立集问题Karci算法有效性的验证

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS

Computer Science-AGH Pub Date : 2022-04-27 DOI:10.53070/bbd.1090368

A. Karcı

{"title":"图论中最大独立集问题Karci算法有效性的验证","authors":"A. Karcı","doi":"10.53070/bbd.1090368","DOIUrl":null,"url":null,"abstract":"The maximum independent set problem is an NP-complete problem in graph theory. The Karci Algorithm is based on fundamental cut-sets of given graph, and node with minimum independence values are selected for maximum independent set. In this study, the analytical verification of this algorithm for some special graphs was analysed, and the obtained results were explained. The verification of Karci’s Algorithm for maximum independent set was handled in partial.","PeriodicalId":41917,"journal":{"name":"Computer Science-AGH","volume":" ","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory\",\"authors\":\"A. Karcı\",\"doi\":\"10.53070/bbd.1090368\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The maximum independent set problem is an NP-complete problem in graph theory. The Karci Algorithm is based on fundamental cut-sets of given graph, and node with minimum independence values are selected for maximum independent set. In this study, the analytical verification of this algorithm for some special graphs was analysed, and the obtained results were explained. The verification of Karci’s Algorithm for maximum independent set was handled in partial.\",\"PeriodicalId\":41917,\"journal\":{\"name\":\"Computer Science-AGH\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science-AGH\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.53070/bbd.1090368\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science-AGH","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53070/bbd.1090368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

最大独立集问题是图论中的一个NP完全问题。Karci算法以给定图的基本割集为基础，选择独立值最小的节点作为最大独立集。本文分析了该算法对某些特殊图的分析验证，并对所得结果进行了解释。对最大独立集的Karci算法进行了部分验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Verification of Karci Algorithm’s Efficiency for Maximum Independent Set Problem in Graph Theory

The maximum independent set problem is an NP-complete problem in graph theory. The Karci Algorithm is based on fundamental cut-sets of given graph, and node with minimum independence values are selected for maximum independent set. In this study, the analytical verification of this algorithm for some special graphs was analysed, and the obtained results were explained. The verification of Karci’s Algorithm for maximum independent set was handled in partial.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computer Science-AGH COMPUTER SCIENCE, THEORY & METHODS-

CiteScore

1.40

自引率

0.00%

发文量

审稿时长

20 weeks