33 citations · 92 across the 17 of their papers we have counts for
18 papers
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…
Efficient Top-k Ego-Betweenness Search
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Betweenness centrality, measured by the number of times a vertex occurs on all shortest paths of a graph, has been recognized as a key indicator for the importance of a vertex in t…
Fairness-aware Maximal Clique in Large Graphs: Concepts and Algorithms
Qi Zhang, Rong-Hua Li, Minjia Pan +3
Cohesive subgraph mining on attributed graphs is a fundamental problem in graph data analysis. Existing cohesive subgraph mining algorithms on attributed graphs do not consider the…