{"id":"https://openalex.org/W4408060199","doi":"https://doi.org/10.14778/3705829.3705839","title":"Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance","display_name":"Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance","publication_year":2024,"publication_date":"2024-10-01","ids":{"openalex":"https://openalex.org/W4408060199","doi":"https://doi.org/10.14778/3705829.3705839"},"language":"en","primary_location":{"id":"doi:10.14778/3705829.3705839","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3705829.3705839","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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 VLDB Endowment","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/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, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, 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":0.8523,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76784587,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"18","issue":"2","first_page":"200","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9973999857902527,"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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9914000034332275,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9909999966621399,"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/computation","display_name":"Computation","score":0.6875019073486328},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6713747978210449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5558616518974304},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.343655526638031},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33444955945014954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3126564621925354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2792719006538391},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1431942582130432}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6875019073486328},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6713747978210449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5558616518974304},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.343655526638031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33444955945014954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3126564621925354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2792719006538391},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1431942582130432}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3705829.3705839","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3705829.3705839","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"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 VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1442132175","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/W1998341696","https://openalex.org/W2005863517","https://openalex.org/W2019284393","https://openalex.org/W2026320281","https://openalex.org/W2036836182","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/W2169088933","https://openalex.org/W2231625113","https://openalex.org/W2290805605","https://openalex.org/W2588222785","https://openalex.org/W2589796617","https://openalex.org/W2801405741","https://openalex.org/W2950303488","https://openalex.org/W3084844108","https://openalex.org/W3092908795","https://openalex.org/W3096767737","https://openalex.org/W3204593736","https://openalex.org/W4283789954","https://openalex.org/W4380433164","https://openalex.org/W4386555845","https://openalex.org/W4402041895"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2393848756","https://openalex.org/W4231775656","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2046435967","https://openalex.org/W2181413294","https://openalex.org/W2052122378"],"abstract_inverted_index":{"k":[0,14,25,61,83,123,128,132,142,152,157,162,167,179,183,197,201,212,217,242,247,326,329],"-defective":[1,26,153,168],"clique":[2,9,27,154,169],"is":[3,58,70,86,300],"a":[4,18,24,87,101,165,262,337],"relaxation":[5],"of":[6,22,32,73,111,140,231,312,335],"the":[7,29,47,71,76,108,137,189,207,226,257,279,322],"well-studied":[8],"structure,":[10],"by":[11,119,135,304,309],"allowing":[12],"up-to":[13],"edges":[15],"missing":[16],"from":[17,324],"clique.":[19],"The":[20,54],"problem":[21],"finding":[23],"with":[28,43,150,278],"largest":[30],"number":[31,72],"vertices,":[33],"although":[34],"being":[35],"NP-hard,":[36],"has":[37],"been":[38],"receiving":[39],"increasing":[40],"interests":[41],"recently,":[42],"advancements":[44],"in":[45,75,173,194,294],"both":[46],"theoretical":[48],"time":[49,56,109,186,204],"complexity":[50,57,110],"and":[51,81,104,193,223,228,250,272,331],"practical":[52,258],"efficiency.":[53],"state-of-the-art":[55],"O*(\u03b3":[59],"n":[60,69,122],")":[62,160,178,185,203,245],",":[63,80,233],"where":[64,126],"O*":[65,120,174],"ignores":[66],"polynomial":[67],"factors,":[68],"vertices":[74],"input":[77],"graph":[78,289],"G":[79,159,219,232,244],"\u03b3":[82,127,131,181,199,325,328],"<":[84,130],"2":[85,249],"constant":[88],"that":[89,107,147,267,297,316],"only":[90],"depends":[91],"on":[92,286],"k.":[93],"In":[94],"this":[95],"paper,":[96],"we":[97,145,260],"first":[98],"prove,":[99],"through":[100],"more":[102],"refined":[103],"non-trivial":[105],"analysis,":[106],"an":[112],"existing":[113,280,307],"algorithm":[114,299],"can":[115,170,268],"actually":[116],"be":[117,171,269,343],"bounded":[118],"(\u03b3":[121],"-1":[124,129,184,202,330],"),":[125],".":[133],"Then,":[134],"utilizing":[136],"diameter-two":[138],"property":[139],"large":[141],"-deffective":[143],"cliques,":[144],"show":[146,296],"for":[148,320],"graphs":[149,239,293],"maximum":[151,166,229],"sizes":[155],"\u03c9":[156,216,241],"(":[158,218,243],"\u2265":[161,246],"+":[163,211,213,248],"2,":[164],"found":[172],"((":[175],"\u03b1":[176,182,192,200,210,222,251],"\u0394":[177,224],"+2":[180,198],"when":[187,205],"using":[188,206],"degeneracy":[190,227],"parameterization":[191,209],"O":[195],"((\u03b1\u0394)":[196],"degeneracy-gap":[208],"1":[214],"-":[215],");":[220],"here,":[221],"are":[225],"degree":[230],"respectively.":[234],"Note":[235],"that,":[236],"most":[237],"real":[238],"satisfy":[240],"\u226a":[252],"n.":[253],"Lastly,":[254],"to":[255,327,345],"improve":[256],"performance,":[259],"design":[261],"new":[263,338],"degree-sequence-based":[264],"reduction":[265,281,339],"rule":[266,340],"efficiently":[270],"applied,":[271],"theoretically":[273],"demonstrate":[274],"its":[275],"effectiveness":[276],"compared":[277],"rules.":[282],"Extensive":[283],"empirical":[284],"studies":[285],"three":[287],"benchmark":[288],"collections,":[290],"containing":[291],"290":[292],"total,":[295],"our":[298,317,332],"also":[301,342],"practically":[302],"efficient,":[303],"outperforming":[305],"all":[306],"algorithms":[308],"several":[310],"orders":[311],"magnitude.":[313],"We":[314],"remark":[315],"proving":[318],"techniques":[319],"reducing":[321],"base":[323],"general":[333],"principle":[334],"designing":[336],"may":[341],"beneficial":[344],"other":[346],"problems.":[347]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}