7 citations · 13 across the 8 of their papers we have counts for
7 papers · 1 filter
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…
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…
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
Kaiqiang Yu, Kaixin Wang, Cheng Long +2
Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between…
Maximal Clique Enumeration with Hybrid Branching and Early Termination
Kaixin Wang, Kaiqiang Yu, Cheng Long
Maximal clique enumeration (MCE) is crucial for tasks like community detection and biological network analysis. Existing algorithms typically adopt the branch-and-bound framework w…
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…
Efficient -Clique Listing: An Edge-Oriented Branching Strategy
Kaixin Wang, Kaiqiang Yu, Cheng Long
-clique listing is a vital graph mining operator with diverse applications in various networks. The state-of-the-art algorithms all adopt a branch-and-bound (BB) framework with…