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
- 6831
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.39898e-05
- Overall Rank
- 9,089 | 36.77%
- 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.00030040036 |
| 583 |
FAQ: Questions Asked Frequently |
2016 |
PODS |
0.00019717214 |
| 999 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014726563 |
| 1,171 |
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs |
2014 |
VLDB |
0.00013511313 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 3,957 |
2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles |
2018 |
VLDB |
6.5903145e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 6,401 |
Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning |
2013 |
VLDB |
5.0801167e-05 |
| 7,675 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.6817479e-05 |
| 8,668 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.4718257e-05 |
| 8,669 |
Distributed Set Reachability |
2016 |
SIGMOD |
4.4718257e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,877 |
Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation |
2015 |
VLDB |
0.00010236803 |
| 2,910 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
7.9266529e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 5,811 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.317401e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 7,675 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.6817479e-05 |