{"id":"https://openalex.org/W7161704549","doi":"https://doi.org/10.48550/arxiv.2605.16948","title":"Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound","display_name":"Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound","publication_year":2026,"publication_date":"2026-05-16","ids":{"openalex":"https://openalex.org/W7161704549","doi":"https://doi.org/10.48550/arxiv.2605.16948"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.16948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16948","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.16948","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101650556","display_name":"Ke Yang","orcid":"https://orcid.org/0009-0008-7684-8397"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Kewu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101870536","display_name":"Kaiqiang Yu","orcid":"https://orcid.org/0000-0003-1153-2902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Kaiqiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136476571","display_name":"Shengxin Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Shengxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136472330","display_name":"Zhaoquan Gu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gu, Zhaoquan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7178999781608582,"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.7178999781608582,"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.06809999793767929,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.03680000081658363,"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/branching","display_name":"Branching (polymer chemistry)","score":0.623199999332428},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6043999791145325},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5982000231742859},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4212999939918518},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4154999852180481},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36469998955726624},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.36250001192092896}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.623199999332428},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6043999791145325},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5982000231742859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5210000276565552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.454800009727478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42500001192092896},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4212999939918518},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4154999852180481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4059999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3953000009059906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36070001125335693},{"id":"https://openalex.org/C177255742","wikidata":"https://www.wikidata.org/wiki/Q4109953","display_name":"Branching process","level":2,"score":0.3488999903202057},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.31610000133514404},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.3010999858379364},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.2766000032424927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.16948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16948","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.16948","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.16948","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"$k$-defective":[1,34],"clique":[2,12,35],"model":[3],"relaxes":[4],"the":[5,10,32,46,52,121,193,214],"strict":[6],"completeness":[7],"constraint":[8],"of":[9,213],"traditional":[11],"by":[13,79],"allowing":[14],"up":[15],"to":[16,76,94,100,131,192],"$k$":[17],"missing":[18],"edges,":[19],"providing":[20],"a":[21,62,111,115,127,146,157,173,179,210],"robust":[22],"formulation":[23],"for":[24],"detecting":[25],"cohesive":[26],"structures":[27],"in":[28],"noisy":[29],"graphs.":[30],"Consequently,":[31],"maximum":[33],"problem":[36,54],"has":[37],"attracted":[38],"significant":[39],"attention.":[40],"State-of-the-art":[41],"exact":[42],"algorithms":[43],"predominantly":[44],"adopt":[45],"branch-and-bound":[47],"framework,":[48],"which":[49,189],"recursively":[50],"partitions":[51],"current":[53],"instance":[55],"(or":[56],"branch)":[57],"into":[58,120],"two":[59],"sub-problems":[60,82],"via":[61],"branching":[63,78,96,123,141,148,194],"procedure,":[64],"until":[65],"each":[66],"sub-problem":[67],"becomes":[68],"trivially":[69],"solvable.":[70,88],"However,":[71],"this":[72,102,153],"strategy":[73,119,149],"often":[74],"leads":[75],"excessive":[77],"overlooking":[80],"intermediate":[81],"that":[83,113,150,199],"are":[84],"non-trivial":[85],"yet":[86],"efficiently":[87],"While":[89],"recent":[90],"studies":[91],"have":[92],"attempted":[93],"refine":[95],"procedures,":[97],"they":[98],"fail":[99],"address":[101,106],"structural":[103],"redundancy.":[104],"To":[105,167],"this,":[107],"we":[108,144,171],"propose":[109,172],"BBRes,":[110],"framework":[112],"incorporates":[114],"novel":[116,180],"early":[117],"termination":[118,154],"recursive":[122],"process.":[124],"By":[125],"employing":[126],"specialized":[128],"polynomial-time":[129],"solver":[130],"identify":[132],"and":[133],"resolve":[134],"tractable":[135],"sub-instances,":[136],"BBRes":[137,159,200],"effectively":[138],"avoids":[139],"redundant":[140],"steps.":[142],"Additionally,":[143],"design":[145],"tailored":[147],"synergizes":[151],"with":[152,186],"mechanism.":[155],"As":[156],"result,":[158],"achieves":[160,201],"an":[161],"improved":[162],"theoretical":[163],"worst-case":[164],"time":[165],"complexity.":[166],"enhance":[168],"practical":[169],"performance,":[170],"tighter":[174],"upper":[175],"bound":[176],"based":[177],"on":[178,209],"double":[181],"graph":[182],"coloring":[183],"method":[184],"integrated":[185],"max-flow":[187],"techniques,":[188],"is":[190],"orthogonal":[191],"framework.":[195],"Extensive":[196],"experiments":[197],"show":[198],"at":[202],"least":[203],"2X":[204],"speedup":[205],"over":[206],"state-of-the-art":[207],"methods":[208],"substantial":[211],"fraction":[212],"datasets.":[215]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-20T00:00:00"}