{"id":"https://openalex.org/W4414360488","doi":"https://doi.org/10.24963/ijcai.2025/1002","title":"Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem","display_name":"Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414360488","doi":"https://doi.org/10.24963/ijcai.2025/1002"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/1002","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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/A5102933831","display_name":"Jiongzhi Zheng","orcid":"https://orcid.org/0000-0001-7201-6720"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiongzhi Zheng","raw_affiliation_strings":["Huazhong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053576258","display_name":"Mingming Jin","orcid":"https://orcid.org/0000-0003-3574-2410"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingming Jin","raw_affiliation_strings":["Huazhong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004999865","display_name":"Kun He","orcid":"https://orcid.org/0000-0003-3472-419X"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kun He","raw_affiliation_strings":["Huazhong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102933831"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37389171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"9014","last_page":"9021"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9261000156402588,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9261000156402588,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9176999926567078,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7742999792098999},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5131000280380249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47780001163482666},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.3495999872684479},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.33820000290870667},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.33320000767707825},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.3165999948978424}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7742999792098999},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5131000280380249},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5012999773025513},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47780001163482666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43959999084472656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43549999594688416},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.3165999948978424},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.30959999561309814},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2897999882698059},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27869999408721924},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/1002","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/1002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Maximum":[1,13],"k-plex":[2],"Problem":[3],"(MKP)":[4],"is":[5,55],"a":[6,17,39,91,124,129],"degree":[7],"relaxation":[8],"of":[9,31,41,66,134,161,176],"the":[10,29,50,56,105,171],"widely":[11],"known":[12],"Clique":[14],"Problem.":[15],"As":[16],"practical":[18],"NP-hard":[19],"problem,":[20],"MKP":[21,61,145],"has":[22],"many":[23],"important":[24],"real-world":[25],"applications,":[26],"such":[27],"as":[28],"analysis":[30],"various":[32],"complex":[33],"networks.":[34],"Branch-and-bound":[35],"(BnB)":[36],"algorithms":[37,46,54,62,146],"are":[38,83],"type":[40],"well-studied":[42],"and":[43,49,73,81,123,140,147,174],"effective":[44],"exact":[45],"for":[47,52],"MKP,":[48],"key":[51],"BnB":[53,60,144,151],"bound":[57,127],"design.":[58],"Recent":[59],"involve":[63],"two":[64],"kinds":[65],"upper":[67,94,108,116,126],"bounds":[68],"based":[69,163],"on":[70,159,164],"graph":[71],"coloring":[72],"partition,":[74],"respectively,":[75],"that":[76,102,120],"work":[77],"in":[78,128],"different":[79],"perspectives":[80],"thus":[82],"complementary":[84],"with":[85],"each":[86],"other.":[87],"We":[88,137],"first":[89],"propose":[90,113],"new":[92,115,150],"coloring-based":[93,107],"bound,":[95,117],"termed":[96,118],"Relaxed":[97],"Graph":[98],"Color":[99],"Bound":[100],"(RelaxGCB),":[101],"significantly":[103],"outperforms":[104],"previous":[106],"bound.":[109],"Then":[110],"we":[111],"further":[112],"another":[114],"RelaxPUB,":[119],"incorporates":[121],"RelaxGCB":[122,139],"partition-based":[125],"novel":[130],"way,":[131],"making":[132],"use":[133],"their":[135],"complementarity.":[136],"apply":[138],"RelaxPUB":[141],"to":[142],"state-of-the-art":[143],"produce":[148],"eight":[149],"algorithms.":[152],"Extensive":[153],"experiments":[154],"using":[155],"diverse":[156],"k":[157],"values":[158],"hundreds":[160],"instances":[162],"dense":[165],"or":[166],"massive":[167],"sparse":[168],"graphs":[169],"demonstrate":[170],"excellent":[172],"performance":[173],"robustness":[175],"our":[177],"proposed":[178],"methods.":[179]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}