30 citations · 52 across the 4 of their papers we have counts for
Showing cs.DBShow 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.DB2012★ 6 cited
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…