7 citations · 18 across the 15 of their papers we have counts for
16 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…
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…
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…
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 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…
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…
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Kaiqiang Yu, Cheng Long
Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis. One notable cohesive structure is -quasi-clique (QC), where each vertex connects at least…
Maximum -Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Kaiqiang Yu, Cheng Long
Enumerating maximal -biplexes (MBPs) of a bipartite graph has been used for applications such as fraud detection. Nevertheless, there usually exists an exponential number of MBP…
Efficient Algorithms for Maximal k-Biplex Enumeration
Kaiqiang Yu, Cheng Long, Shengxin Liu +1
Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each verte…
Reconfigurable Intelligent Surface Assisted Massive MIMO with Antenna Selection
Jinglian He, Kaiqiang Yu, Yuanming Shi +3
Antenna selection is capable of reducing the hardware complexity of massive multiple-input multiple-output (MIMO) networks at the cost of certain performance degradation. Reconfigu…
Reconfigurable Intelligent Surface Enhanced Cognitive Radio Networks
Jinglian He, Kaiqiang Yu, Yong Zhou +1
The cognitive radio (CR) network is a promising network architecture that meets the requirement of enhancing scarce radio spectrum utilization. Meanwhile, reconfigurable intelligen…
Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network
Jinglian He, Kaiqiang Yu, Yuanming Shi
Intelligent reflecting surface (IRS) is a proposing technology in 6G to enhance the performance of wireless networks by smartly reconfiguring the propagation environment with a lar…
Efficient Algorithms for Densest Subgraph Discovery
Yixiang Fang, Kaiqiang Yu, Reynold Cheng +2
Densest subgraph discovery (DSD) is a fundamental problem in graph mining. It has been studied for decades, and is widely used in various areas, including network science, biologic…