1 citations · 1 across the 6 of their papers we have counts for
4 papers · 1 filter
Efficient -core Computation and On-the-fly Query at Billion Scale with GPUs
Qingshuai Feng, Shunyang Li, Kai Wang +3
In bipartite graphs, -core is a widely used model for cohesive subgraph mining. Specifically, an -core is a maximal subgraph in which each vertex in the upper layer h…
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
Yiqi Wang, Long Yuan, Wenjie Zhang +3
Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on location-based services. As direct search using the Dijkstra's algorithm results in a large searc…
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs
Long Yuan, Kongzhang Hao, Xuemin Lin +1
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…
GPUSCAN:Efficient Structural Graph Clustering on GPUs
Long Yuan, Zeyu Zhou, Xuemin Lin +3
Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the state-of-the-art GPU…