{"id":"https://openalex.org/W4386555845","doi":"https://doi.org/10.1145/3617313","title":"Efficient Maximum k-Defective Clique Computation with Improved Time Complexity","display_name":"Efficient Maximum k-Defective Clique Computation with Improved Time Complexity","publication_year":2023,"publication_date":"2023-11-13","ids":{"openalex":"https://openalex.org/W4386555845","doi":"https://doi.org/10.1145/3617313"},"language":"en","primary_location":{"id":"doi:10.1145/3617313","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3617313","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2309.02635","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney, Sydney, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6830-3900","affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037530341"],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":2.0727,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89205445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"1","issue":"3","first_page":"1","last_page":"26"},"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.9988999962806702,"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.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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/T11106","display_name":"Data Management and Algorithms","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/benchmark","display_name":"Benchmark (surveying)","score":0.7463849782943726},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6640328168869019},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6620877981185913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.623222827911377},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5589893460273743},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5558595061302185},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5455427169799805},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5389789342880249},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46390268206596375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4495764672756195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44535285234451294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2485639452934265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19022715091705322},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10211601853370667},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.09361341595649719}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7463849782943726},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6640328168869019},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6620877981185913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.623222827911377},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5589893460273743},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5558595061302185},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5455427169799805},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5389789342880249},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46390268206596375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4495764672756195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44535285234451294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2485639452934265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19022715091705322},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10211601853370667},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.09361341595649719},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3617313","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3617313","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2309.02635","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2309.02635","pdf_url":"https://arxiv.org/pdf/2309.02635","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.4230/lipics.ipec.2025.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2025.22","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2309.02635","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2309.02635","pdf_url":"https://arxiv.org/pdf/2309.02635","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386555845.pdf","grobid_xml":"https://content.openalex.org/works/W4386555845.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1442132175","https://openalex.org/W1586552957","https://openalex.org/W1594785451","https://openalex.org/W1594951361","https://openalex.org/W1823437338","https://openalex.org/W1971756951","https://openalex.org/W1980096229","https://openalex.org/W1983402337","https://openalex.org/W2005863517","https://openalex.org/W2023536175","https://openalex.org/W2026320281","https://openalex.org/W2045027193","https://openalex.org/W2073025989","https://openalex.org/W2084512860","https://openalex.org/W2089494972","https://openalex.org/W2094224753","https://openalex.org/W2097844290","https://openalex.org/W2106119591","https://openalex.org/W2110582765","https://openalex.org/W2128334576","https://openalex.org/W2148606255","https://openalex.org/W2169088933","https://openalex.org/W2231625113","https://openalex.org/W2290805605","https://openalex.org/W2401610261","https://openalex.org/W2588222785","https://openalex.org/W2589796617","https://openalex.org/W2801405741","https://openalex.org/W2950303488","https://openalex.org/W2953102514","https://openalex.org/W2998215451","https://openalex.org/W3006622885","https://openalex.org/W3084844108","https://openalex.org/W3092908795","https://openalex.org/W3096767737","https://openalex.org/W4210727445","https://openalex.org/W4225137014","https://openalex.org/W4283789954","https://openalex.org/W6608099265","https://openalex.org/W6679215085"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W2082603400","https://openalex.org/W1796509207","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W2162082186","https://openalex.org/W2960805326","https://openalex.org/W2005991213","https://openalex.org/W4285171291"],"abstract_inverted_index":{"k-defective":[0,43,96],"cliques":[1,3],"relax":[2],"by":[4,184,247],"allowing":[5],"up-to":[6],"k":[7],"missing":[8],"edges":[9],"from":[10,69,119],"being":[11,52,70],"a":[12,154,168,207,221],"complete":[13],"graph.":[14],"This":[15],"relaxation":[16],"enables":[17],"us":[18],"to":[19,135,199],"find":[20],"larger":[21],"near-cliques":[22],"and":[23,34,74,105,166,194,215],"has":[24,45],"applications":[25],"in":[26,54,99,236],"link":[27],"prediction,":[28],"cluster":[29],"detection,":[30],"social":[31],"network":[32],"analysis":[33],"transportation":[35],"science.":[36],"The":[37,176],"problem":[38],"of":[39,90,101,164,179,250],"finding":[40],"the":[41,55,58,71,88,91,111,116,132,138,144,160,242],"largest":[42],"clique":[44,97],"been":[46],"recently":[47],"studied":[48],"with":[49,233],"several":[50,248],"algorithms":[51],"proposed":[53],"literature.":[56],"However,":[57],"currently":[59,243],"fastest":[60,244],"algorithm":[61,217,245],"KDBB":[62,246],"does":[63],"not":[64,81,142],"improve":[65,137],"its":[66],"time":[67,103,117,147,162,170,177],"complexity":[68,104,118,163,171,178],"trivial":[72,161],"O(2n),":[73],"also,":[75],"KDBB's":[76],"practical":[77,106,124,139],"performance":[78,125],"is":[79,181],"still":[80],"satisfactory.":[82],"In":[83,149],"this":[84,127],"paper,":[85],"we":[86,109,151,204],"advance":[87],"state":[89],"art":[92],"for":[93,114,123,218],"exact":[94],"maximum":[95],"computation,":[98],"terms":[100],"both":[102],"performance.":[107],"Moreover,":[108],"separate":[110],"techniques":[112],"required":[113],"achieving":[115],"others":[120],"purely":[121],"used":[122],"consideration;":[126],"design":[128],"choice":[129],"may":[130],"facilitate":[131],"research":[133],"community":[134],"further":[136,205],"efficiency":[140],"while":[141],"sacrificing":[143],"worst":[145],"case":[146],"complexity.":[148],"specific,":[150],"first":[152],"develop":[153],"general":[155],"framework":[156],"kDC":[157,180,201,240],"that":[158,239],"beats":[159],"O(2n)":[165],"achieves":[167],"better":[169],"than":[172],"all":[173],"existing":[174],"algorithms.":[175],"solely":[182],"achieved":[183],"our":[185],"newly":[186],"designed":[187],"non-fully-adjacent-first":[188],"branching":[189],"rule,":[190],"excess-removal":[191],"reduction":[192,196,213],"rule":[193],"high-degree":[195],"rule.":[197],"Then,":[198],"make":[200],"practically":[202],"efficient,":[203],"propose":[206],"new":[208,212],"upper":[209],"bound,":[210],"two":[211],"rules,":[214],"an":[216],"efficiently":[219],"computing":[220],"large":[222],"initial":[223],"solution.":[224],"Extensive":[225],"empirical":[226],"studies":[227],"on":[228],"three":[229],"benchmark":[230],"graph":[231],"collections":[232],"290":[234],"graphs":[235],"total":[237],"demonstrate":[238],"outperforms":[241],"orders":[249],"magnitude.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2023-09-09T00:00:00"}