{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:16:11Z","timestamp":1783152971119,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792114","type":"proceedings-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:54:34Z","timestamp":1775771674000},"page":"535-546","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5253-7545","authenticated-orcid":false,"given":"Hongbo","family":"Xia","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5786-6938","authenticated-orcid":false,"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7546-852X","authenticated-orcid":false,"given":"Zhaoquan","family":"Gu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Source Code. https:\/\/github.com\/SmartProbiotics\/EQC-Pro."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the DIMACS Workshop on External Memory Algorithms. 119--130","author":"Abello James","unstructured":"James Abello, Panos M. Pardalos, and Mauricio G. C. Resende. 1998. On maximum clique problems in very large graphs. In Proceedings of the DIMACS Workshop on External Memory Algorithms. 119--130."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"J. Abello M. G. C. Resende and S. Sudarsky. 2002. Massive quasi-clique detection. In LATIN. 598--612.","DOI":"10.1007\/3-540-45995-2_51"},{"key":"e_1_3_2_1_4_1","volume-title":"CoRR cs.DS\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matja\u017e Zaver\u0161nik. 2003. An O (m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1178"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0132-x"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Marco Brunato Holger H. Hoos and Roberto Battiti. 2007. On effectively finding maximal quasi-cliques in graphs. In LION. 41--55.","DOI":"10.1007\/978-3-540-92695-5_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617313"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3705829.3705839"},{"key":"e_1_3_2_1_10_1","volume-title":"Cohesive Subgraph Computation over Large Sparse Graphs","author":"Chang Lijun","unstructured":"Lijun Chang and Lu Qin. 2018. Cohesive Subgraph Computation over Large Sparse Graphs. Springer Publishing Company, Incorporated."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565816.3565817"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639318"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Jiejiang Chen Shaowei Cai Shiwei Pan Yiyuan Wang Qingwei Lin Mengyu Zhao and Minghao Yin. 2021. NuQClq: An effective local search algorithm for maximum quasi-clique problem. In AAAI. 12258--12266.","DOI":"10.1609\/aaai.v35i14.17455"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105131"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3677142"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588931"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457538"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Jian Gao Zhenghang Xu Ruizhi Li and Minghao Yin. 2022. An exact algorithm with new upper bounds for the maximum k-defective clique problem in massive sparse graphs. In AAAI. 10174 -- 10183.","DOI":"10.1609\/aaai.v36i9.21257"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3705829.3705851"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01874-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00712-2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Christian Komusiewicz Manuel Sorge and Kolja Stahl. 2015. Finding connected subgraphs of fixed minimum density: Implementation and experiments. In SEA. 82--93.","DOI":"10.1007\/978-3-319-20086-6_7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_25_1","unstructured":"Guimei Liu and Limsoon Wong. 2008. Effective pruning techniques for mining quasi-cliques. In ECML\/PKDD. 33--49."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.2173"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq514"},{"key":"e_1_3_2_1_28_1","unstructured":"Chunyu Luo Yi Zhou Zhengren Wang and Mingyu Xiao. 2024. A faster branching algorithm for the maximum k-defective clique problem. In ECAI. 4132--4139."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.02.003"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00091-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1938"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1242-y"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21791"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.07.019"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ahsanur Rahman Kalyan Roy Ramiza Maliha and Townim Faisal Chowdhury. 2024. A fast exact algorithm to enumerate maximal pseudo-cliques in large sparse graphs. In SIGKDD. 2479--2490.","DOI":"10.1145\/3637528.3672066"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12637"},{"key":"e_1_3_2_1_37_1","volume-title":"Mining Largest Maximal Quasi-Cliques. ACM Transactions on Knowledge Discovery from Data 15","author":"Sanei-Mehri Seyed-Vahid","year":"2021","unstructured":"Seyed-Vahid Sanei-Mehri, Apurba Das, Hooman Hashemi, and Srikanta Tirthapura. 2021. Mining Largest Maximal Quasi-Cliques. ACM Transactions on Knowledge Discovery from Data 15 (2021), 81:1--81:21."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw488"},{"key":"e_1_3_2_1_39_1","volume-title":"Koobface: The evolution of the social botnet. In 2010 eCrime Researchers Summit. 1--10.","author":"Tanner Brian K.","year":"2010","unstructured":"Brian K. Tanner, Gary Warner, Henry Stern, and Scott Olechowski. 2010. Koobface: The evolution of the social botnet. In 2010 eCrime Researchers Summit. 1--10."},{"key":"e_1_3_2_1_40_1","volume-title":"Tsiarli","author":"Tsourakakis Charalampos E.","year":"2013","unstructured":"Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria A. Tsiarli. 2013. Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In SIGKDD. 104--112."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9238-3"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9804-y"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Hongbo Xia Kaiqiang Yu Shengxin Liu Cheng Long and Xun Zhou. 2025. Maximum degree-based quasi-clique search via an iterative framework. In SIGKDD. 3285--3296.","DOI":"10.1145\/3711896.3737041"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl014"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Kaiqiang Yu and Cheng Long. 2021. Graph Mining Meets Fake News Detection. In Data Science for Fake News. 169--189.","DOI":"10.1007\/978-3-030-62696-9_8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617331"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:24:25Z","timestamp":1783149865000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":46,"alternative-id":["10.1145\/3774904.3792114","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792114","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}