{"id":"https://openalex.org/W2972193540","doi":"https://doi.org/10.1109/codit.2019.8820347","title":"Contraction-based method for computing a lower bound on the clique number of a graph","display_name":"Contraction-based method for computing a lower bound on the clique number of a graph","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2972193540","doi":"https://doi.org/10.1109/codit.2019.8820347","mag":"2972193540"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2019.8820347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5082426194","display_name":"Assia Gueham","orcid":null},"institutions":[{"id":"https://openalex.org/I4210107086","display_name":"University of Algiers 3","ror":"https://ror.org/01pynjp12","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210107086"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Assia Gueham","raw_affiliation_strings":["Faculty of Management Science, University of Algiers3, Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"Faculty of Management Science, University of Algiers3, Algiers, Algeria","institution_ids":["https://openalex.org/I4210107086"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015062900","display_name":"Hac\u00e8ne A\u00eft Haddad\u00e8ne","orcid":"https://orcid.org/0000-0001-8808-850X"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]},{"id":"https://openalex.org/I192268740","display_name":"University of Algiers Benyoucef Benkhedda","ror":"https://ror.org/011r6gp69","country_code":"DZ","type":"education","lineage":["https://openalex.org/I192268740"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hacene AIT Haddadene","raw_affiliation_strings":["Faculty of Mathematics, USTHB University, Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, USTHB University, Algiers, Algeria","institution_ids":["https://openalex.org/I192268740","https://openalex.org/I157169809"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039450050","display_name":"Anass Nagih","orcid":"https://orcid.org/0000-0002-3604-3390"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anass Nagih","raw_affiliation_strings":["LCOMS-UFR MIM, Lorraine University, Metz, France"],"affiliations":[{"raw_affiliation_string":"LCOMS-UFR MIM, Lorraine University, Metz, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082426194"],"corresponding_institution_ids":["https://openalex.org/I4210107086"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14092746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1758","last_page":"1762"},"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.9995999932289124,"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.9995999932289124,"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.9994999766349792,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6102110147476196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5164275765419006},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.506606936454773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4914034605026245},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4911062717437744},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4809912443161011},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.46271297335624695},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44433826208114624},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.43787962198257446},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4287794232368469},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.4247913360595703},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.42246392369270325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3588758111000061},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.354521244764328},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1598881483078003},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10885921120643616},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1027950644493103},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.06236010789871216}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6102110147476196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5164275765419006},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.506606936454773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4914034605026245},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4911062717437744},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4809912443161011},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.46271297335624695},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44433826208114624},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.43787962198257446},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4287794232368469},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.4247913360595703},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.42246392369270325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3588758111000061},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.354521244764328},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1598881483078003},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10885921120643616},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1027950644493103},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.06236010789871216},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"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.1109/codit.2019.8820347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1484343014","https://openalex.org/W1574847221","https://openalex.org/W1639912615","https://openalex.org/W1970871468","https://openalex.org/W1990396700","https://openalex.org/W1994532070","https://openalex.org/W2003142262","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2046112356","https://openalex.org/W2074300280","https://openalex.org/W2074619214","https://openalex.org/W2082616837","https://openalex.org/W2105664651","https://openalex.org/W2115713772","https://openalex.org/W2120146316","https://openalex.org/W2157797797","https://openalex.org/W2158663853","https://openalex.org/W2162579105","https://openalex.org/W2166742555","https://openalex.org/W2401610261","https://openalex.org/W4232548171"],"related_works":["https://openalex.org/W2219991221","https://openalex.org/W2086520272","https://openalex.org/W2098381534","https://openalex.org/W1544712886","https://openalex.org/W2091356038","https://openalex.org/W2019546243","https://openalex.org/W199404365","https://openalex.org/W2067182946","https://openalex.org/W2035637517","https://openalex.org/W2929047994"],"abstract_inverted_index":{"This":[0,35],"paper":[1],"proposes":[2],"a":[3,14,20],"new":[4],"method":[5,36],"to":[6,38],"determine":[7],"the":[8,25,29,47,56],"clique":[9,48],"of":[10,33,46,55],"maximum":[11],"cardinality":[12],"in":[13],"graph.":[15],"More":[16],"precisely,":[17],"we":[18],"propose":[19],"contraction-based":[21],"approach,":[22],"which":[23],"uses":[24],"orientation":[26],"algorithm":[27],"and":[28,43],"labeling":[30],"order":[31],"scheme":[32],"vertices.":[34],"allows":[37],"effeciently":[39],"compute":[40],"both":[41],"upper":[42],"lower":[44],"bounds":[45],"number.":[49],"The":[50],"experimental":[51],"results":[52],"on":[53],"instances":[54],"library":[57],"DIMACS":[58],"are":[59],"validated":[60],"against":[61],"our":[62],"method.":[63]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}