{"id":"https://openalex.org/W2001535712","doi":"https://doi.org/10.1109/icis.2013.6607889","title":"A polynomial-time algorithm for the maximum clique problem","display_name":"A polynomial-time algorithm for the maximum clique problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2001535712","doi":"https://doi.org/10.1109/icis.2013.6607889","mag":"2001535712"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2013.6607889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2013.6607889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014112728","display_name":"Zohreh Akbari","orcid":"https://orcid.org/0000-0001-8322-2722"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Zohreh O. Akbari","raw_affiliation_strings":["Department of Mathematics and Computer Science, Friedrich Schiller University, Jena, Germany","Department of Mathematics and Computer Science, Friedrich-Schiller-University, Jena, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Friedrich Schiller University, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Friedrich-Schiller-University, Jena, Germany#TAB#","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014112728"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":2.1753,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87223287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":null,"first_page":"503","last_page":"507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.8728924989700317},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6475583910942078},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.557854950428009},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5322325825691223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5205398797988892},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48898470401763916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4760979413986206},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.438494473695755},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4368547797203064},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4342576861381531},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.419631689786911},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3822171092033386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3498157262802124},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18855655193328857},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07797810435295105},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07579335570335388}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.8728924989700317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6475583910942078},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.557854950428009},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5322325825691223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5205398797988892},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48898470401763916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4760979413986206},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.438494473695755},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4368547797203064},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4342576861381531},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.419631689786911},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3822171092033386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3498157262802124},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18855655193328857},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07797810435295105},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07579335570335388},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2013.6607889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2013.6607889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1970871468","https://openalex.org/W1975442866","https://openalex.org/W2006060642","https://openalex.org/W2011039300","https://openalex.org/W2019578639","https://openalex.org/W2036265926","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2091469954","https://openalex.org/W2097844290","https://openalex.org/W2119025565","https://openalex.org/W2141815340","https://openalex.org/W2148352980","https://openalex.org/W2152971731","https://openalex.org/W2165813048","https://openalex.org/W2335760940","https://openalex.org/W2401610261","https://openalex.org/W2478278609","https://openalex.org/W2797618585","https://openalex.org/W2801915865","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W2165678151","https://openalex.org/W4285171291","https://openalex.org/W4394163840"],"abstract_inverted_index":{"After":[0],"more":[1],"than":[2],"six":[3],"decades":[4],"of":[5,15,43,77],"its":[6],"introduction,":[7],"the":[8,16,21,40,55,75],"maximum":[9,41],"clique":[10,42,56],"problem,":[11,37,57,61],"which":[12,38,72],"is":[13],"one":[14],"most":[17],"applicable":[18],"problems":[19],"in":[20,65],"graph":[22,46],"theory,":[23],"has":[24],"still":[25],"no":[26],"polynomial-time":[27,33],"solution.":[28],"This":[29,51],"paper":[30],"presents":[31],"a":[32,44,48,69],"algorithm":[34],"for":[35],"this":[36],"detects":[39],"given":[45],"through":[47],"recursive":[49],"approach.":[50],"polynomial":[52,70],"solution":[53],"to":[54,67,74],"as":[58],"an":[59],"NP-complete":[60],"causes":[62],"every":[63],"problem":[64],"NP":[66,80],"have":[68],"solution,":[71],"leads":[73],"equality":[76],"P":[78],"and":[79],"complexity":[81],"classes.":[82]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}