30 citations · 52 across the 4 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DB2016★ 4 cited
Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph
Huanhuan Wu, Yuzhen Huang, James Cheng +2
A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., calls at 11 a.m. and talks for 7 minutes, which is modeled by an edge from…
cs.DC2016★ 12 cited
Efficient Processing of Very Large Graphs in a Small Cluster
Da Yan, Yuzhen Huang, James Cheng +1
Inspired by the success of Google's Pregel, many systems have been developed recently for iterative computation over big graphs. These systems provide a user-friendly vertex-centri…