{"id":"https://openalex.org/W7125375423","doi":"https://doi.org/10.48550/arxiv.2601.14619","title":"Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks","display_name":"Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks","publication_year":2026,"publication_date":"2026-01-21","ids":{"openalex":"https://openalex.org/W7125375423","doi":"https://doi.org/10.48550/arxiv.2601.14619"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.14619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.14619","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.2601.14619","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123598956","display_name":"Hongbo Xia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xia, Hongbo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001583118","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/A5040547391","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/T10064","display_name":"Complex Network Analysis Techniques","score":0.5156000256538391,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5156000256538391,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.22939999401569366,"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.1185000017285347,"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/pruning","display_name":"Pruning","score":0.7032999992370605},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5716999769210815},{"id":"https://openalex.org/keywords/iterative-and-incremental-development","display_name":"Iterative and incremental development","score":0.5537999868392944},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5149999856948853},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4812999963760376},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.478300005197525},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4700999855995178},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44670000672340393}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7032999992370605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5848000049591064},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5716999769210815},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.5537999868392944},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5149999856948853},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48089998960494995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4700999855995178},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44670000672340393},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4269999861717224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41350001096725464},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3734999895095825},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33160001039505005},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2797999978065491},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.14619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.14619","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.2601.14619","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.14619","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":{"Extracting":[0],"cohesive":[1],"subgraphs":[2,33],"from":[3],"complex":[4],"networks":[5],"is":[6,14,49,55],"a":[7,28,38,79,103,112,138],"fundamental":[8],"task":[9],"in":[10],"graph":[11],"analytics":[12],"and":[13,20,57,71,86,101,121,124,136],"essential":[15],"for":[16],"understanding":[17],"biological,":[18],"social,":[19],"web":[21],"graphs.":[22,93],"The":[23],"edge-based":[24,47],"$\u03b3$-quasi-clique":[25],"model":[26],"offers":[27],"flexible":[29],"alternative":[30],"by":[31,162],"identifying":[32],"whose":[34],"edge":[35],"densities":[36],"exceed":[37],"specified":[39],"threshold":[40],"$\u03b3$.":[41],"However,":[42],"finding":[43],"the":[44,53,59,65,72,99,109,126,133],"exact":[45],"maximum":[46],"quasi-clique":[48],"computationally":[50],"challenging,":[51],"as":[52,84,111],"problem":[54,100,110],"NP-hard":[56],"lacks":[58],"hereditary":[60,115],"property.":[61],"These":[62],"characteristics":[63],"limit":[64],"effectiveness":[66],"of":[67,74,114,167],"conventional":[68],"pruning":[69,120],"methods":[70,161],"development":[73],"efficient":[75],"reduction":[76,122],"rules.":[77],"As":[78],"result,":[80],"existing":[81,160],"algorithms,":[82],"such":[83],"QClique":[85],"FPCE,":[87],"struggle":[88],"to":[89,91,141,164],"scale":[90],"large":[92],"In":[94],"this":[95],"paper,":[96],"we":[97,131],"revisit":[98],"propose":[102],"novel":[104,139],"iterative":[105,134],"framework":[106],"that":[107,154],"reformulates":[108],"sequence":[113],"subproblems,":[116],"enabling":[117],"more":[118],"effective":[119],"strategies":[123],"improving":[125],"worst-case":[127],"time":[128],"complexity.":[129],"Furthermore,":[130],"redesign":[132],"process":[135],"introduce":[137],"heuristic":[140],"further":[142],"improve":[143],"practical":[144],"efficiency.":[145],"Extensive":[146],"experiments":[147],"on":[148],"253":[149],"large-scale":[150],"real-world":[151],"graphs":[152],"demonstrate":[153],"our":[155],"proposed":[156],"algorithm":[157],"EQC-Pro":[158],"outperforms":[159],"up":[163],"four":[165],"orders":[166],"magnitude.":[168]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-01-23T00:00:00"}