Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale
Summary: A distributed hybrid-search, divide-and-conquer algorithm enumerates hop-constrained simple s-t paths at billion-graph scale, pruning fruitless exploration while bounding memory. Idle-triggered load balancing handles skew, and bidirectional search further accelerates enumeration. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kongzhang Hao (Nanjing University; University of New South Wales)
- 2. Long Yuan (Nanjing University; University of New South Wales)
- 3. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@article{hao_vldb22,
title = {{Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale}},
author = {Hao, Kongzhang and Yuan, Long and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {2},
pages = {169--182},
doi = {10.14778/3489496.3489499},
url = {https://doi.org/10.14778/3489496.3489499},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 5.3201316e-05 |
| 10,452 | Enumerating Graph Pattern Matches with ML Oracles | 2026 | SIGMOD | 5.093636e-05 |
| 10,748 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 5.093636e-05 |
| 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,144 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB |
| 2 | 5,296 | Fast and Robust Distributed Subgraph Enumeration | 2019 | VLDB |
| 3 | 2,065 | Scalable Distributed Subgraph Enumeration | 2017 | VLDB |
| 4 | 10,498 | Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC | 2026 | SIGMOD |
| 5 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 6 | 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 7 | 10,748 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD |
| 8 | 4,551 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB |
| 9 | 5,938 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD |
| 10 | 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD |