research
∙
05/23/2023
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Mining cohesive subgraphs from a graph is a fundamental problem in graph...
share
research
∙
08/28/2022
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Enumerating maximal k-biplexes (MBPs) of a bipartite graph has been used...
research
∙
12/29/2021
Efficient Algorithms for Maximal k-Biplex Enumeration
Mining maximal subgraphs with cohesive structures from a bipartite graph...
research
∙
09/16/2020
Reconfigurable Intelligent Surface Assisted Massive MIMO with Antenna Selection
Antenna selection is capable of reducing the hardware complexity of mass...
research
∙
02/14/2020
Coordinated Passive Beamforming for Distributed Intelligent Reflecting Surfaces Network
Intelligent reflecting surface (IRS) is a proposing technology in 6G to ...
research
∙
06/02/2019
