{"id":"https://openalex.org/W2043005464","doi":"https://doi.org/10.1137/0215075","title":"Finding a Maximum Clique in an Arbitrary Graph","display_name":"Finding a Maximum Clique in an Arbitrary Graph","publication_year":1986,"publication_date":"1986-11-01","ids":{"openalex":"https://openalex.org/W2043005464","doi":"https://doi.org/10.1137/0215075","mag":"2043005464"},"language":"en","primary_location":{"id":"doi:10.1137/0215075","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215075","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5072070820","display_name":"Egon Balas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Egon Balas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087098003","display_name":"Chang Sung Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chang Sung Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4316,"has_fulltext":false,"cited_by_count":293,"citation_normalized_percentile":{"value":0.96936692,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"15","issue":"4","first_page":"1054","last_page":"1068"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8318884372711182},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7380625605583191},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6389639377593994},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6387054324150085},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.5913851857185364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5008323192596436},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4824433922767639},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.46636733412742615},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4619806706905365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45177358388900757},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4330921769142151},{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.42922377586364746},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.4146277904510498},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2247246503829956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2161296308040619},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18345630168914795},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.11220851540565491},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.0772099494934082}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8318884372711182},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7380625605583191},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6389639377593994},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6387054324150085},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.5913851857185364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5008323192596436},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4824433922767639},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.46636733412742615},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4619806706905365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45177358388900757},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4330921769142151},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.42922377586364746},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.4146277904510498},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2247246503829956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2161296308040619},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18345630168914795},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.11220851540565491},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0772099494934082},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215075","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215075","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W47629461","https://openalex.org/W1973310391","https://openalex.org/W1997998268","https://openalex.org/W2013415302","https://openalex.org/W2035331304","https://openalex.org/W2041210844","https://openalex.org/W2045027193","https://openalex.org/W2048053250","https://openalex.org/W2058408846","https://openalex.org/W2082242399","https://openalex.org/W2086119402","https://openalex.org/W2089465933","https://openalex.org/W2097844290","https://openalex.org/W2116007667","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W2789636091","https://openalex.org/W3008959778","https://openalex.org/W2963588823","https://openalex.org/W2288163449","https://openalex.org/W2032950096","https://openalex.org/W4300575715","https://openalex.org/W1533352539","https://openalex.org/W176100319","https://openalex.org/W4381707488","https://openalex.org/W2282273380"],"abstract_inverted_index":{"We":[0,59],"describe":[1],"a":[2,12,39,52],"new":[3],"type":[4],"of":[5,27,44,57],"branch":[6],"and":[7,46,72],"bound":[8],"procedure":[9],"for":[10,37,50],"finding":[11,38,51],"maximum":[13],"clique":[14],"in":[15],"an":[16,35,48],"arbitrary":[17],"graph":[18],"$G":[19],"=":[20],"(V,E)$.":[21],"The":[22],"two":[23],"main":[24],"ingredients,":[25],"both":[26],"$O(|V|":[28],"+":[29],"|E|)$":[30],"time":[31],"complexity,":[32],"are":[33],"(i)":[34],"algorithm":[36,49],"maximal":[40,53],"triangulated":[41],"induced":[42,55],"subgraph":[43,56],"G;":[45],"(ii)":[47],"k-chromatic":[54],"G.":[58],"discuss":[60],"computational":[61],"experience":[62],"on":[63],"randomly":[64],"generated":[65],"graphs":[66],"with":[67],"up":[68],"to":[69],"400":[70],"vertices":[71],"30,000":[73],"edges.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}