203 citations · 273 across the 14 of their papers we have counts for
4 papers · 1 filter
Distance Landmarks Revisited for Road Graphs
Shuai Ma, Kaiyu Feng, Haixun Wang +2
Computing shortest distances is one of the fundamental problems on graphs, and remains a {\em challenging} task today. {\em Distance} {\em landmarks} have been recently studied for…
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…
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases
Ye Yuan, Guoren Wang, Lei Chen +1
Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, in…
Efficient Subgraph Matching on Billion Node Graphs
Zhao Sun, Hongzhi Wang, Haixun Wang +2
The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph…