Accelerating Exact Constrained Shortest Paths on GPUs
Summary: Vine accelerates exact CSP on GPUs by parallelizing labeling. Two-level pruning exploiting GPU memory and adaptive parallelism tuned to degree of parallelism deliver 18x CPU speedup and competitive exact performance vs approximate/indexed methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shengliang Lu (National University of Singapore)
- 2. Bingsheng He (National University of Singapore)
- 3. Yuchen Li (Singapore Management University)
- 4. Hao Fu (Tianjin University)
BibTeX Citation
@article{lu_vldb21,
title = {{Accelerating Exact Constrained Shortest Paths on GPUs}},
author = {Lu, Shengliang and He, Bingsheng and Li, Yuchen and Fu, Hao},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {4},
pages = {547--559},
doi = {10.14778/3436905.3436914},
url = {https://doi.org/10.14778/3436905.3436914},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,249 | Self-adaptive Graph Traversal on GPUs | 2021 | SIGMOD | 5.8358127e-05 |
| 6,509 | GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection | 2021 | SIGMOD | 5.7601316e-05 |
| 9,543 | FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints | 2022 | VLDB | 5.1614165e-05 |
| 11,449 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB | 4.9793485e-05 |
| 11,698 | ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee | 2023 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 8.4178183e-05 |
| 2,602 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 8.2325477e-05 |
| 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD | 6.7343908e-05 |
| 4,237 | Accelerating Dynamic Graph Analytics on GPUs | 2018 | VLDB | 6.7107028e-05 |
| 5,300 | Parallel Personalized PageRank on Dynamic Graphs | 2018 | VLDB | 6.1896851e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 2 | 11,338 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB |
| 3 | 4,139 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD |
| 4 | 7,377 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 5 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 6 | 1,269 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 7 | 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |
| 8 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 9 | 10,568 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD |
| 10 | 11,449 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB |