30 citations · 52 across the 4 of their papers we have counts for
4 papers
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…
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…
Temporal Graph Traversals: Definitions, Algorithms, and Applications
Silu Huang, James Cheng, Huanhuan Wu
A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that ar…
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying on Large Graphs
Ada Wai-Chee Fu, Huanhuan Wu, James Cheng +2
We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications. Quite a number of indexes have been pr…