{"id":"https://openalex.org/W3089495291","doi":"https://doi.org/10.3390/a13100253","title":"The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm","display_name":"The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm","publication_year":2020,"publication_date":"2020-10-04","ids":{"openalex":"https://openalex.org/W3089495291","doi":"https://doi.org/10.3390/a13100253","mag":"3089495291"},"language":"en","primary_location":{"id":"doi:10.3390/a13100253","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13100253","pdf_url":"https://www.mdpi.com/1999-4893/13/10/253/pdf?version=1603178638","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/10/253/pdf?version=1603178638","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064976367","display_name":"Derek H. Smith","orcid":"https://orcid.org/0000-0002-8128-2067"},"institutions":[{"id":"https://openalex.org/I128993996","display_name":"University of South Wales","ror":"https://ror.org/02mzn7s88","country_code":"GB","type":"education","lineage":["https://openalex.org/I128993996"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Derek H. Smith","raw_affiliation_strings":["School of Computing and Mathematics, University of South Wales, Pontypridd, Cardiff CF37 1DL, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing and Mathematics, University of South Wales, Pontypridd, Cardiff CF37 1DL, UK","institution_ids":["https://openalex.org/I128993996"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017492288","display_name":"Roberto Montemanni","orcid":"https://orcid.org/0000-0002-0229-0465"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Montemanni","raw_affiliation_strings":["Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2 (Pad. Morselli), 42122 Modena MO, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2 (Pad. Morselli), 42122 Modena MO, Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064124520","display_name":"Stephanie Perkins","orcid":"https://orcid.org/0000-0002-6292-8731"},"institutions":[{"id":"https://openalex.org/I128993996","display_name":"University of South Wales","ror":"https://ror.org/02mzn7s88","country_code":"GB","type":"education","lineage":["https://openalex.org/I128993996"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stephanie Perkins","raw_affiliation_strings":["School of Computing and Mathematics, University of South Wales, Pontypridd, Cardiff CF37 1DL, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing and Mathematics, University of South Wales, Pontypridd, Cardiff CF37 1DL, UK","institution_ids":["https://openalex.org/I128993996"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064976367"],"corresponding_institution_ids":["https://openalex.org/I128993996"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.2968,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82688607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"10","first_page":"253","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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.9873999953269958,"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/tabu-search","display_name":"Tabu search","score":0.7745079398155212},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7235428094863892},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.7095881700515747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6167372465133667},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6160215139389038},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5443193316459656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5127278566360474},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.481962651014328},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3840057849884033},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18923282623291016},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17724665999412537},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09313678741455078}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7745079398155212},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7235428094863892},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.7095881700515747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6167372465133667},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6160215139389038},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5443193316459656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5127278566360474},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.481962651014328},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3840057849884033},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18923282623291016},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17724665999412537},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09313678741455078},{"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":4,"locations":[{"id":"doi:10.3390/a13100253","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13100253","pdf_url":"https://www.mdpi.com/1999-4893/13/10/253/pdf?version=1603178638","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d585068f89c24142a0406f6393b7b5d9","is_oa":true,"landing_page_url":"https://doaj.org/article/d585068f89c24142a0406f6393b7b5d9","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 10, p 253 (2020)","raw_type":"article"},{"id":"pmh:oai:iris.unimore.it:11380/1211455","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1211455","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/10/253/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13100253","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 13; Issue 10; Pages: 253","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13100253","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13100253","pdf_url":"https://www.mdpi.com/1999-4893/13/10/253/pdf?version=1603178638","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3089495291.pdf","grobid_xml":"https://content.openalex.org/works/W3089495291.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W613386655","https://openalex.org/W1982382042","https://openalex.org/W2004598385","https://openalex.org/W2026320281","https://openalex.org/W2037016941","https://openalex.org/W2066356146","https://openalex.org/W2119089575","https://openalex.org/W2167036627","https://openalex.org/W2316949380","https://openalex.org/W2401610261","https://openalex.org/W2792872327","https://openalex.org/W2889273098","https://openalex.org/W2918291539","https://openalex.org/W2940838630","https://openalex.org/W2966028273","https://openalex.org/W2980928319","https://openalex.org/W4241981193","https://openalex.org/W4254034017"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W4300229885","https://openalex.org/W2891037262","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W1487885374","https://openalex.org/W2550802162","https://openalex.org/W4224326468"],"abstract_inverted_index":{"Let":[0],"G=(V,E)":[1],"be":[2],"an":[3,58],"undirected":[4],"graph":[5,70],"with":[6,27,41,109],"vertex":[7],"set":[8,12],"V":[9,26],"and":[10,76,137],"edge":[11],"E.":[13],"A":[14,35,47],"clique":[15,37,40,54,141],"C":[16,33],"of":[17,22,25,30,32,45],"G":[18],"is":[19,38,63,86,107,120,132],"a":[20,39,69,110,139],"subset":[21],"the":[23,42,52,77,95,124],"vertices":[24,31],"every":[28],"pair":[29],"adjacent.":[34],"maximum":[36,43,53],"number":[44],"vertices.":[46],"tabu":[48,90],"search":[49,91],"algorithm":[50,60,67,80,92,112],"for":[51,74,101,128,134,142],"problem":[55],"that":[56,113],"uses":[57,68],"exact":[59,66,117],"on":[61],"subproblems":[62],"presented.":[64],"The":[65,88],"coloring":[71],"upper":[72],"bound":[73],"pruning,":[75],"best":[78,98],"such":[79],"to":[81,122],"use":[82,116],"in":[83],"this":[84],"context":[85],"considered.":[87,105],"final":[89],"successfully":[93],"finds":[94,138],"optimal":[96,126],"or":[97],"known":[99,125],"solution":[100,127],"all":[102],"standard":[103],"benchmarks":[104],"It":[106,119],"compared":[108],"state-of-the-art":[111],"does":[114],"not":[115],"search.":[118],"slower":[121],"find":[123],"most":[129],"instances":[130,136],"but":[131],"faster":[133],"five":[135],"larger":[140],"two":[143],"instances.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-10-08T00:00:00"}