FHL-cube: Multi-constraint shortest path querying with flexible combination of constraints

Z Liu, L Li, M Zhang, W Hua, X Zhou - Proceedings of the VLDB …, 2022 - dl.acm.org
Multi-Constraint Shortest Path (MCSP) generalizes the classic shortest path from single to
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …

Global routing optimization in road networks

Y Xu, L Li, M Zhang, Z Xu, X Zhou - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
Route planning plays an increasingly important role in our society, and the routing results,
which are the paths that vehicles actually travel in a road network, which influence the traffic …

Gpu-accelerated graph label propagation for real-time fraud detection

C Ye, Y Li, B He, Z Li, J Sun - … of the 2021 International Conference on …, 2021 - dl.acm.org
Fraud detection is a pressing challenge for most financial and commercial platforms. In this
paper, we study the processing pipeline of fraud detection in a large e-commerce platform of …

A Survey on Concurrent Processing of Graph Analytical Queries: Systems and Algorithms

Y Li, S Sun, H **ao, C Ye, S Lu… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Graph analytical queries (GAQs) are becoming increasingly important in various domains,
including social networks, recommendation systems, and bioinformatics, among others …

Accelerating Maximal Bicliques Enumeration with GPU on large scale network

C Wu, J Li, Z Li, J Zhang, P Tang - Future Generation Computer Systems, 2024 - Elsevier
Bicliques, as a prevalent graph pattern, are of particular interest in graph mining and social
network analysis, especially for detecting illegal activities on e-commerce platforms due to …

Accelerating biclique counting on gpu

L Qiu, Z Li, X Ke, L Chen, Y Gao - 2024 IEEE 40th International …, 2024 - ieeexplore.ieee.org
Counting (p, q)-bicliques in bipartite graphs poses a foundational challenge with broad
applications, from densest sub-graph discovery in algorithmic research to personalized …

Self-adaptive graph traversal on gpus

M Sha, Y Li, KL Tan - Proceedings of the 2021 International Conference …, 2021 - dl.acm.org
GPU's massive computing power offers unprecedented opportunities to enable large graph
analysis. Existing studies proposed various preprocessing approaches that convert the input …

Efficient navigation for constrained shortest path with adaptive expansion control

W **a, Y Li, W Guo, S Li - 2022 IEEE International Conference …, 2022 - ieeexplore.ieee.org
In many route planning applications, finding constrained shortest paths (CSP) is an
important and fundamental problem. CSP aims to find the shortest path between two nodes …

A graph pattern mining framework for large graphs on GPU

L Hu, Y Lin, L Zou, MT Özsu - The VLDB Journal, 2025 - Springer
Graph pattern mining (GPM) is an important problem in graph processing. There are many
parallel frameworks for GPM, many of which suffer from low performance. GPU is a powerful …

Global Optimal Travel Planning for Massive Travel Queries in Road Networks

Y Xu, L Li, M Zhang, Z Xu, X Zhou - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Travel planning plays an increasingly important role in our society. The travel plans, which
consist of the paths each vehicle is suggested to follow and its corresponding departure …