Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice
Summary: Hop-constrained s-t simple path enumeration; BC-DFS with barrier-based pruning achieves polynomial delay O(km) per output, matching the best bound. JOIN, a join-oriented variant, further reduces latency; experiments on 15 real networks show practical superiority over state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. You Peng (University of New South Wales)
- 2. Ying Zhang (University of Technology Sydney)
- 3. Xuemin Lin (University of New South Wales)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Lu Qin (University of Technology Sydney)
- 6. Jingren Zhou (Alibaba)
BibTeX Citation
@article{peng_vldb20,
title = {{Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice}},
author = {Peng, You and Zhang, Ying and Lin, Xuemin and Zhang, Wenjie and Qin, Lu and Zhou, Jingren},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {4},
pages = {463--476},
doi = {10.14778/3372716.3372720},
url = {https://doi.org/10.14778/3372716.3372720},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 2 | 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD |
| 3 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 4 | 4,541 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |
| 5 | 10,748 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD |
| 6 | 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 7 | 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD |
| 8 | 8,650 | Towards Generating Hop-constrained s-t Simple Path Graphs | 2023 | SIGMOD |
| 9 | 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 10 | 5,938 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD |