Back to papers
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
Summary: Distributed method for hop-constrained simple-path enumeration on large graphs, with graph reduction pruning vertices outside the hop bound. Blends shared-subpath pruning, bounded intermediate storage, workload-aware task division, and vertex migration to cut communication, delivering up to 1000x speedups vs HybridEnum.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6832
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.3947639e-05
- Overall Rank
- 9,086 | 36.86%
- DOI
-
10.1145/3639277
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030020929 |
| 564 |
FAQ: Questions Asked Frequently |
2016 |
PODS |
0.00020002796 |
| 1,000 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014714977 |
| 1,170 |
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs |
2014 |
VLDB |
0.00013526297 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 3,221 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3541078e-05 |
| 3,959 |
2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles |
2018 |
VLDB |
6.583977e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 6,207 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1519085e-05 |
| 6,396 |
Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning |
2013 |
VLDB |
5.0752439e-05 |
| 7,674 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.677258e-05 |
| 8,666 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.467539e-05 |
| 8,667 |
Distributed Set Reachability |
2016 |
SIGMOD |
4.467539e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,876 |
Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation |
2015 |
VLDB |
0.00010242818 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 5,809 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.3175972e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 6,207 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1519085e-05 |
| 7,674 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.677258e-05 |