4 papers
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
Kewu Yang, Kaiqiang Yu, Shengxin Liu +1
The -defective clique model relaxes the strict completeness constraint of the traditional clique by allowing up to missing edges, providing a robust formulation for detectin…
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…
Temporal -Core Query, Revisited
Yinyu Liu, Kaiqiang Yu, Shengxin Liu +2
Querying cohesive subgraphs in temporal graphs is essential for understanding the dynamic structure of real-world networks, such as evolving communities in social platforms, shifti…
Maximum -Plex Search: An Alternated Reduction-and-Bound Method
Shuohao Gao, Kaiqiang Yu, Shengxin Liu +1
-plexes relax cliques by allowing each vertex to disconnect to at most vertices. Finding a maximum -plex in a graph is a fundamental operator in graph mining and has been…