{"id":"https://openalex.org/W4298145080","doi":"https://doi.org/10.1142/s1793830922501476","title":"Maximum max-k-clique subgraphs in cactus subtree graphs","display_name":"Maximum max-k-clique subgraphs in cactus subtree graphs","publication_year":2022,"publication_date":"2022-09-30","ids":{"openalex":"https://openalex.org/W4298145080","doi":"https://doi.org/10.1142/s1793830922501476"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922501476","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501476","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5078313840","display_name":"F\u01cenic\u01ce Gavril","orcid":"https://orcid.org/0000-0001-9584-2232"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Fanica Gavril","raw_affiliation_strings":["Computer Science Department, Technion, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0001-9584-2232","affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078313840"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.1508,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51107152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"06","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9944999814033508,"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.9944999814033508,"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.9812999963760376,"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/T12288","display_name":"Optimization and Search Problems","score":0.9319000244140625,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.809006929397583},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6517251133918762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6146537661552429},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5889835357666016},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5718282461166382},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4952920973300934},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4724358022212982},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46875548362731934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36321645975112915},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.175462007522583}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.809006929397583},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6517251133918762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6146537661552429},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5889835357666016},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5718282461166382},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4952920973300934},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4724358022212982},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46875548362731934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36321645975112915},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.175462007522583},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922501476","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501476","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.6299999952316284,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W85139696","https://openalex.org/W1520704862","https://openalex.org/W1576190294","https://openalex.org/W1964982423","https://openalex.org/W1978452004","https://openalex.org/W1991410678","https://openalex.org/W2013949481","https://openalex.org/W2046662728","https://openalex.org/W2048237851","https://openalex.org/W2060438030","https://openalex.org/W2060670627","https://openalex.org/W2062221600","https://openalex.org/W2065908606","https://openalex.org/W2074937107","https://openalex.org/W2078024271","https://openalex.org/W2118348286","https://openalex.org/W2132816737","https://openalex.org/W2175518075","https://openalex.org/W2618202168","https://openalex.org/W2751108426"],"related_works":["https://openalex.org/W2963588823","https://openalex.org/W2307034528","https://openalex.org/W4300575715","https://openalex.org/W2168309835","https://openalex.org/W3165892239","https://openalex.org/W2032950096","https://openalex.org/W2022237586","https://openalex.org/W2082848707","https://openalex.org/W21133947","https://openalex.org/W2613459475"],"abstract_inverted_index":{"In":[0,63,79,109],"this":[1,66],"paper,":[2],"we":[3,111],"analyze":[4],"the":[5,71],"intersection":[6],"graphs":[7,65,115],"of":[8,20],"subtrees":[9],"in":[10,52],"a":[11,21,39,45,53,92,102],"cactus,":[12],"called":[13],"cactus":[14,54,113],"subtree":[15,55,114],"graphs.":[16],"A":[17],"max-k-clique":[18],"subgraph":[19,26,51,77,97,107],"graph":[22,56],"is":[23,61,68,99],"an":[24],"induced":[25,127,131],"whose":[27],"maximum":[28,46,72,93,103,121,124,126,130],"clique":[29],"has":[30],"at":[31],"most":[32],"[Formula:":[33,58,74,104],"see":[34,49,59,75,95,105],"text]":[35,60],"vertices.":[36],"We":[37],"describe":[38,112],"polynomial":[40,116],"time":[41,117],"algorithm":[42],"to":[43,70],"find":[44],"weight":[47,73],"max-[Formula:":[48,94],"text]-clique":[50,96],"when":[57],"fixed.":[62],"perfect":[64],"problem":[67],"equivalent":[69],"text]-colorable":[76,106],"problem.":[78],"many":[80],"applications":[81],"like":[82],"scheduling":[83],"production":[84],"lines":[85],"and":[86,133],"communication":[87],"networks":[88],"on":[89],"imperfect":[90],"graphs,":[91,129],"solution":[98],"better":[100],"than":[101],"solution.":[108],"addition,":[110],"algorithms":[118],"for":[119],"recognition,":[120],"independent":[122],"sets,":[123],"cliques,":[125],"bipartite":[128],"forests":[132],"minimum":[134],"feedback":[135],"vertex":[136],"sets.":[137]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}