{"id":"https://openalex.org/W3120218232","doi":"https://doi.org/10.3390/a14010022","title":"Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs","display_name":"Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs","publication_year":2021,"publication_date":"2021-01-13","ids":{"openalex":"https://openalex.org/W3120218232","doi":"https://doi.org/10.3390/a14010022","mag":"3120218232"},"language":"en","primary_location":{"id":"doi:10.3390/a14010022","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14010022","pdf_url":"https://www.mdpi.com/1999-4893/14/1/22/pdf","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/14/1/22/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074202524","display_name":"Chuan-Min Lee","orcid":"https://orcid.org/0000-0003-3456-6697"},"institutions":[{"id":"https://openalex.org/I192703390","display_name":"Ming Chuan University","ror":"https://ror.org/02pgvzy25","country_code":"TW","type":"education","lineage":["https://openalex.org/I192703390"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chuan-Min Lee","raw_affiliation_strings":["Department of Computer and Communication Engineering, Ming Chuan University, 5 De Ming Road, Guishan District, Taoyuan City 333, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Communication Engineering, Ming Chuan University, 5 De Ming Road, Guishan District, Taoyuan City 333, Taiwan","institution_ids":["https://openalex.org/I192703390"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074202524"],"corresponding_institution_ids":["https://openalex.org/I192703390"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.1838,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.81051541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"1","first_page":"22","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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":0.9998000264167786,"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.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/T11476","display_name":"Graph theory and applications","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.8241031169891357},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.8132253885269165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7527416944503784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7116524577140808},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6953703761100769},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6554803252220154},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6131664514541626},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.510068953037262},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4960685670375824},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.49291229248046875},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4397839903831482},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.40289169549942017},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.20232835412025452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14633509516716003},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10215705633163452}],"concepts":[{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.8241031169891357},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8132253885269165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7527416944503784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7116524577140808},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6953703761100769},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6554803252220154},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6131664514541626},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.510068953037262},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4960685670375824},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.49291229248046875},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4397839903831482},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.40289169549942017},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.20232835412025452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14633509516716003},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10215705633163452}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14010022","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14010022","pdf_url":"https://www.mdpi.com/1999-4893/14/1/22/pdf","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:1dd5f1e5b2f843e3a50c914006cdd250","is_oa":true,"landing_page_url":"https://doaj.org/article/1dd5f1e5b2f843e3a50c914006cdd250","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 1, p 22 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/1/22/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14010022","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 14; Issue 1; Pages: 22","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14010022","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14010022","pdf_url":"https://www.mdpi.com/1999-4893/14/1/22/pdf","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":[{"id":"https://openalex.org/G7288783372","display_name":null,"funder_award_id":"NSC-97-2218-E-130-002-MY2","funder_id":"https://openalex.org/F4320321040","funder_display_name":"National Science Council"}],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3120218232.pdf","grobid_xml":"https://content.openalex.org/works/W3120218232.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W105087603","https://openalex.org/W1579049696","https://openalex.org/W1852278469","https://openalex.org/W1971095627","https://openalex.org/W1973391616","https://openalex.org/W1991604152","https://openalex.org/W1994364012","https://openalex.org/W1995194793","https://openalex.org/W2012550027","https://openalex.org/W2019034047","https://openalex.org/W2020808467","https://openalex.org/W2021102038","https://openalex.org/W2029818886","https://openalex.org/W2033877075","https://openalex.org/W2036195668","https://openalex.org/W2037106315","https://openalex.org/W2044652744","https://openalex.org/W2046263886","https://openalex.org/W2047843604","https://openalex.org/W2052760902","https://openalex.org/W2055049645","https://openalex.org/W2062210818","https://openalex.org/W2065614946","https://openalex.org/W2068218174","https://openalex.org/W2083472526","https://openalex.org/W2089465933","https://openalex.org/W2188975458","https://openalex.org/W3022416027","https://openalex.org/W3124913715","https://openalex.org/W6638968139","https://openalex.org/W6686990776"],"related_works":["https://openalex.org/W3120218232","https://openalex.org/W2898526288","https://openalex.org/W2046263886","https://openalex.org/W2004663694","https://openalex.org/W77483341","https://openalex.org/W2078489643","https://openalex.org/W2045135589","https://openalex.org/W2599254863","https://openalex.org/W2949556766","https://openalex.org/W4300330793"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,11,17,58,74,95,98,109],"maximum-clique":[4],"independence":[5,90],"problem":[6,14,77],"and":[7,24,49,64,71,100,104,128],"some":[8],"variations":[9],"of":[10],"clique":[12,26,40,66,84,89,102],"transversal":[13,27,67,76,85],"such":[15],"as":[16],"{k}-clique,":[18,59],"maximum-clique,":[19],"minus":[20,60],"clique,":[21,23,61,63],"signed":[22,62,99],"k-fold":[25,65],"problems":[28,103,111],"from":[29],"algorithmic":[30],"aspects":[31],"for":[32,69,81,108],"k-trees,":[33],"suns,":[34,70],"planar":[35,117],"graphs,":[36,39,42,44,46,48,118,121,123,125,127],"doubly":[37,119],"chordal":[38,51,120,130],"perfect":[41],"total":[43,122],"split":[45,124],"line":[47,126],"dually":[50,129],"graphs.":[52,131],"We":[53,92],"give":[54],"equations":[55],"to":[56],"compute":[57],"numbers":[68,86],"show":[72,94],"that":[73],"{k}-clique":[75],"is":[78],"polynomial-time":[79],"solvable":[80],"graphs":[82],"whose":[83],"equal":[87],"their":[88],"numbers.":[91],"also":[93],"relationship":[96],"between":[97],"generalization":[101],"present":[105],"NP-completeness":[106],"results":[107],"considered":[110],"on":[112],"k-trees":[113],"with":[114],"unbounded":[115],"k,":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}