1 citations · 1 across the 21 of their papers we have counts for
4 papers · 1 filter
A Computationally Efficient Framework for Overlapping Community Detection in Large Bipartite Graphs
Yue Zeng, Rong-Hua Li, Qiangqiang Dai +1
Community detection, which uncovers closely connected vertex groups in networks, is vital for applications in social networks, recommendation systems, and beyond. Real-world networ…
Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
Cheng Li, Meihao Liao, Rong-Hua Li +1
Kemeny constant, defined as the expected hitting time of random walks from a source node to a randomly chosen target node, is a fundamental metric in graph data management with man…
Optimal -Dense Subgraph Search in Bipartite Graphs
Yalong Zhang, Rong-Hua Li, Qi Zhang +1
Dense subgraph search in bipartite graphs is a fundamental problem in graph analysis, with wide-ranging applications in fraud detection, recommendation systems, and social network…
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…