2 citations · 3 across the 9 of their papers we have counts for
10 papers
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…
ProbDiffFlow: An Efficient Learning-Free Framework for Probabilistic Single-Image Optical Flow Estimation
Mo Zhou, Jianwei Wang, Xuanmeng Zhang +5
This paper studies optical flow estimation, a critical task in motion analysis with applications in autonomous navigation, action recognition, and film production. Traditional opti…
Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
Lingkai Meng, Long Yuan, Xuemin Lin +3
Bipartite graphs are commonly used to model relationships between two distinct entities in real-world applications, such as user-product interactions, user-movie ratings and collab…
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…
A Survey of Distributed Graph Algorithms on Massive Graphs
Lingkai Meng, Yu Shao, Long Yuan +7
Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and…
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…
Effective Community Search on Large Attributed Bipartite Graphs
Zongyu Xu, Yihao Zhang, Long Yuan +5
Community search over bipartite graphs has attracted significant interest recently. In many applications such as user-item bipartite graph in E-commerce, customer-movie bipartite g…
Balanced Clique Computation in Signed Networks: Concepts and Algorithms
Zi Chen, Long Yuan, Xuemin Lin +2
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, ma…
Higher-Order Neighborhood Truss Decomposition
Zi Chen, Long Yuan, Li Han +1
-truss model is a typical cohesive subgraph model and has been received considerable attention recently. However, the -truss model only considers the direct common neighbors…