2 citations · 3 across the 15 of their papers we have counts for
5 papers · 1 filter
Revisiting Maximum -Biplex Search Through -Bounded-Degree Deletion
Donghang Cui, Ronghua Li, Qiangqiang Dai +1
Biplex, as a relaxation of the biclique model, has emerged as an important cohesive subgraph model for bipartite graph analysis. The maximum -biplex search problem aims to ident…
On the Efficient Discovery of Maximum -Defective Biclique
Donghang Cui, Ronghua Li, Qiangqiang Dai +2
The problem of identifying the maximum edge biclique in bipartite graphs has attracted considerable attention in bipartite graph analysis, with numerous real-world applications suc…
Scalable Algorithms for Laplacian Pseudo-inverse Computation
Meihao Liao, Rong-Hua Li, Qiangqiang Dai +2
The pseudo-inverse of a graph Laplacian matrix, denoted as , finds extensive application in various graph analysis tasks. Notable examples include the calculation of ele…
Scaling Up Maximal k-plex Enumeration
Qiangqiang Dai, Rong-Hua Li, Hongchao Qin +2
Finding all maximal -plexes on networks is a fundamental research problem in graph analysis due to many important applications, such as community detection, biological graph ana…
Scaling Up Distance-generalized Core Decomposition
Qiangqiang Dai, Rong-Hua Li, Lu Qin +4
Core decomposition is a fundamental operator in network analysis. In this paper, we study the problem of computing distance-generalized core decomposition on a network. A distance-…