2 papers
cs.SI2026
Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
Hongbo Xia, Shengxin Liu, Zhaoquan Gu
Extracting cohesive subgraphs from complex networks is a fundamental task in graph analytics and is essential for understanding biological, social, and web graphs. The edge-based $…
cs.SI2025
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
Hongbo Xia, Kaiqiang Yu, Shengxin Liu +2
Cohesive subgraph mining is a fundamental problem in graph theory with numerous real-world applications, such as social network analysis and protein-protein interaction modeling. A…