7 citations · 18 across the 15 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DB2026
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…
cs.DS2026
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
Kaixin Wang, Kaiqiang Yu, Cheng Long
The maximal biclique enumeration problem in bipartite graphs is fundamental and has numerous applications in E-commerce and transaction networks. Most existing studies adopt a bran…
cs.SI2026
Efficient Computation of Maximum Flexi-Clique in Networks
Song Kim, Hyewon Kim, Kaiqiang Yu +4
Discovering large cohesive subgraphs is a key task for graph mining. Existing models, such as clique, k-plex, and γ-quasi-clique, use fixed density thresholds that overlook the nat…