62 citations · 537 across the 44 of their papers we have counts for
8 papers · 1 filter
G-Tran: Making Distributed Graph Transactions Fast
Hongzhi Chen, Changji Li, Chenguang Zheng +4
Graph transaction processing raises many unique challenges such as random data access due to the irregularity of graph structures, low throughput and high abort rate due to the rel…
Hierarchical Graph Matching Network for Graph Similarity Computation
Haibo Xiu, Xiao Yan, Xiaoqiang Wang +2
Graph edit distance / similarity is widely used in many tasks, such as graph similarity search, binary function analysis, and graph clustering. However, computing the exact graph e…
Convolutional Embedding for Edit Distance
Xinyan Dai, Xiao Yan, Kaiwen Zhou +3
Edit-distance-based string similarity search has many applications such as spell correction, data de-duplication, and sequence alignment. However, computing edit distance is known…
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…
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks
Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong +1
We study the problem of point-to-point distance querying for massive scale-free graphs, which is important for numerous applications. Given a directed or undirected graph, we propo…
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…
K-Reach: Who is in Your Small World
James Cheng, Zechao Shang, Hong Cheng +2
We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target que…
Truss Decomposition in Massive Networks
Jia Wang, James Cheng
The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomia…