32 citations · 59 across the 10 of their papers we have counts for
10 papers
Finding Top-r Influential Communities under Aggregation Functions
You Peng, Song Bian, Rui Li +2
Community search is a problem that seeks cohesive and connected subgraphs in a graph that satisfy certain topology constraints, e.g., degree constraints. The majority of existing w…
A Fast Order-Based Approach for Core Maintenance
Yikai Zhang, Jeffrey Xu Yu, Ying Zhang +1
Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive sub…
I/O Efficient Core Graph Decomposition at Web Scale
Dong Wen, Lu Qin, Ying Zhang +2
Core decomposition is a fundamental graph problem with a large number of applications. Most existing approaches for core decomposition assume that the graph is kept in memory of a…
Approximate Closest Community Search in Networks
Xin Huang, Laks V. S. Lakshmanan, Jeffrey Xu Yu +1
Recently, there has been significant interest in the study of the community search problem in social and information networks: given one or more query nodes, find densely connected…
Efficient Truss Maintenance in Evolving Networks
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu +2
Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within…
Evolution of cooperation in spatial traveler's dilemma game
Rong-Hua Li, Jeffrey Xu Yu, Jiyuan Lin
Traveler's dilemma (TD) is one of social dilemmas which has been well studied in the economics community, but it is attracted little attention in the physics community. The TD game…