33 citations · 92 across the 17 of their papers we have counts for
6 papers · 1 filter
Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs
Ziqi Yin, Qi Zhang, Wentao Zhang +2
Maximal biclique enumeration is a fundamental problem in bipartite graph data analysis. Existing biclique enumeration methods mainly focus on non-attributed bipartite graphs and al…
Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank
Longlong Lin, Pingpeng Yuan, Rong-Hua Li +4
Existing temporal community search suffers from two defects: (i) they ignore the temporal proximity between the query vertex and other vertices but simply require the result to…
Scalable and Effective Conductance-based Graph Clustering
Longlong Lin, Rong-Hua Li, Tao Jia
Conductance-based graph clustering has been recognized as a fundamental operator in numerous graph analysis applications. Despite the significant success of conductance-based graph…
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-…
Efficient Core Maintenance in Large Dynamic Graphs
Rong-Hua Li, Jeffrey Xu Yu
The -core decomposition in a graph is a fundamental problem for social network analysis. The problem of -core decomposition is to calculate the core number for every node in…