{"title":"最大团问题的多项式时间算法","authors":"Z. Akbari","doi":"10.1109/ICIS.2013.6607889","DOIUrl":null,"url":null,"abstract":"After more than six decades of its introduction, the maximum clique problem, which is one of the most applicable problems in the graph theory, has still no polynomial-time solution. This paper presents a polynomial-time algorithm for this problem, which detects the maximum clique of a given graph through a recursive approach. This polynomial solution to the clique problem, as an NP-complete problem, causes every problem in NP to have a polynomial solution, which leads to the equality of P and NP complexity classes.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"68 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A polynomial-time algorithm for the maximum clique problem\",\"authors\":\"Z. Akbari\",\"doi\":\"10.1109/ICIS.2013.6607889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"After more than six decades of its introduction, the maximum clique problem, which is one of the most applicable problems in the graph theory, has still no polynomial-time solution. This paper presents a polynomial-time algorithm for this problem, which detects the maximum clique of a given graph through a recursive approach. This polynomial solution to the clique problem, as an NP-complete problem, causes every problem in NP to have a polynomial solution, which leads to the equality of P and NP complexity classes.\",\"PeriodicalId\":345020,\"journal\":{\"name\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"volume\":\"68 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2013.6607889\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2013.6607889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A polynomial-time algorithm for the maximum clique problem
After more than six decades of its introduction, the maximum clique problem, which is one of the most applicable problems in the graph theory, has still no polynomial-time solution. This paper presents a polynomial-time algorithm for this problem, which detects the maximum clique of a given graph through a recursive approach. This polynomial solution to the clique problem, as an NP-complete problem, causes every problem in NP to have a polynomial solution, which leads to the equality of P and NP complexity classes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
