33 citations · 92 across the 17 of their papers we have counts for
7 papers · 1 filter
Mining Bursting Communities in Temporal Graphs
Hongchao Qin, Rong-Hua Li, Guoren Wang +3
Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential to seek emergency events in temporal graphs. Unfortunately, most previous stud…
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
Longxu Sun, Xin Huang, Rong-Hua Li +1
Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group search over a weighted…
Efficient Estimation of Heat Kernel PageRank for Local Clustering
Renchi Yang, Xiaokui Xiao, Zhewei Wei +3
Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the clu…
Exploring Hierarchies in Online Social Networks
Can Lu, Jeffrey Xu Yu, Rong-Hua Li +1
Social hierarchy (i.e., pyramid structure of societies) is a fundamental concept in sociology and social network analysis. The importance of social hierarchy in a social network is…
Random-walk domination in large graphs: problem definitions and fast solutions
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang +1
We introduce and formulate two types of random-walk domination problems in graphs motivated by a number of applications in practice (e.g., item-placement problem in online social n…
A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang +1
A trust network is a social network in which edges represent the trust relationship between two nodes in the network. In a trust network, a fundamental question is how to assess an…