activity
20112022
most citedEvolution of cooperation in spatial traveler's dilemma game

32 citations · 59 across the 10 of their papers we have counts for

collaborators
Showing cs.DBShow all

6 papers · 1 filter

cs.DB2016★ 4 cited

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…

cs.DB2015★ 1 cited

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…

cs.DB2014★ 16 cited

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…

cs.DB2012★ 1 cited

Detecting Priming News Events

Di Wu, Yiping Ke, Jeffrey Xu Yu +1

We study a problem of detecting priming events based on a time series index and an evolving document stream. We define a priming event as an event which triggers abnormal movements…

cs.DB2011

Relational Approach for Shortest Path Discovery over Large Graphs

Jun Gao, Ruoming Jin, Jiashuai Zhou +3

With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take…

cs.DB2011

ELCA Evaluation for Keyword Search on Probabilistic XML Data

Rui Zhou, Chengfei Liu, Jianxin Li +1

As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support k…