{"id":"https://openalex.org/W7162553830","doi":"https://doi.org/10.48550/arxiv.2605.26235","title":"Scalable Algorithm for Dynamic Quasi-clique Detection","display_name":"Scalable Algorithm for Dynamic Quasi-clique Detection","publication_year":2026,"publication_date":"2026-05-25","ids":{"openalex":"https://openalex.org/W7162553830","doi":"https://doi.org/10.48550/arxiv.2605.26235"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.26235","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26235","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.26235","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137094963","display_name":"Jingbang Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Jingbang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060243777","display_name":"W. Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Weinuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137151079","display_name":"Yingli Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Yingli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137171143","display_name":"Hao Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Hao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137121921","display_name":"Can Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Can","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137154448","display_name":"Yixiang Fang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang, Yixiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137102684","display_name":"Chenhao Ma","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ma, Chenhao","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/T12292","display_name":"Graph Theory and Algorithms","score":0.6546000242233276,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6546000242233276,"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.07880000025033951,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0494999997317791,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7882000207901001},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.616599977016449},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.6086000204086304},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6079000234603882},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5212000012397766},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.46140000224113464},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3133000135421753}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7882000207901001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7878000140190125},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.616599977016449},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6079000234603882},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5212000012397766},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.46140000224113464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44519999623298645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4147999882698059},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35350000858306885},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3001999855041504},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.26235","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26235","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.26235","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.26235","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Identifying":[0],"dense":[1,210],"subgraphs":[2],"known":[3],"as":[4,16],"quasi-cliques":[5,117],"is":[6],"pivotal":[7],"in":[8,32,79,213],"numerous":[9],"graph":[10,81,84],"mining":[11,212],"tasks":[12],"across":[13],"domains":[14],"such":[15],"social":[17],"networks,":[18],"biology,":[19],"and":[20,43,51,74,111,122,141,150,208],"e-commerce.":[21],"While":[22],"prior":[23],"work":[24,195],"has":[25],"developed":[26],"efficient":[27,199],"algorithms":[28],"for":[29,53,202],"quasi-clique":[30,78,189,204],"detection":[31],"static":[33,48,165],"graphs,":[34],"real-world":[35,149],"networks":[36],"are":[37],"inherently":[38],"dynamic,":[39],"where":[40],"edges":[41],"appear":[42],"disappear":[44],"continuously.":[45],"This":[46,194],"renders":[47],"methods":[49],"inefficient":[50],"ill-suited":[52],"real-time":[54,209],"analysis.":[55],"In":[56],"this":[57],"paper,":[58],"we":[59,125,175],"initiate":[60],"the":[61,64,76,135,184,197],"study":[62],"of":[63,100,161],"Dynamic":[65],"Maximum":[66],"Quasi-Clique":[67],"Problem":[68],"(DMQCP),":[69],"which":[70],"aims":[71],"to":[72,114,132,158,187],"maintain":[73,115,188],"update":[75],"largest":[77],"a":[80,89,128,172,178],"under":[82,143],"streaming":[83],"updates.":[85,145],"We":[86],"propose":[87,177],"DMI,":[88],"novel":[90],"MinHash-based":[91],"dynamic":[92,203],"framework":[93,179,201],"that":[94,154,181],"supports":[95],"fast,":[96],"high-quality":[97],"approximate":[98],"maintenance":[99],"quasi-cliques.":[101],"DMI":[102,155],"leverages":[103],"two":[104],"update-efficient":[105],"hashing":[106],"schemes,":[107],"i.e.,":[108],"$l$-buffered":[109],"$k$-MinHash":[110],"Bottom-$k$":[112],"MinHash,":[113],"candidate":[116,136],"incrementally.":[118],"To":[119],"ensure":[120],"robustness":[121],"reduce":[123],"bias,":[124],"further":[126],"design":[127],"batch":[129],"reconstruction":[130],"strategy":[131],"periodically":[133],"rebuild":[134],"set,":[137],"guaranteeing":[138],"both":[139],"stability":[140],"adaptability":[142],"frequent":[144],"Extensive":[146],"experiments":[147],"on":[148],"synthetic":[151],"datasets":[152],"show":[153],"achieves":[156],"up":[157],"four":[159],"orders":[160],"magnitude":[162],"speedup":[163],"over":[164],"baselines,":[166],"while":[167,191],"preserving":[168],"solution":[169],"quality.":[170],"As":[171],"side":[173],"product,":[174],"also":[176],"NSF":[180],"primarily":[182],"uses":[183],"neighbor-search":[185],"technique":[186],"candidates":[190],"edge":[192],"updating.":[193],"establishes":[196],"first":[198],"algorithmic":[200],"extraction,":[205],"enabling":[206],"scalable":[207],"subgraph":[211],"evolving":[214],"networks.":[215]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-28T00:00:00"}