Back to papers
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)
- Paper ID
- 12249
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 6.1049756e-05
- Overall Rank
- 4,534 | 68.46%
- DOI
-
10.14778/3372716.3372720
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-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 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,720 |
RICH: Real-time Identification of negative Cycles for High-efficiency Arbitrage |
2025 |
VLDB |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 999 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014726563 |
| 1,054 |
On k-skip Shortest Paths |
2011 |
SIGMOD |
0.00014422699 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,844 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.00010341077 |
| 2,188 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3372315e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 3,957 |
2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles |
2018 |
VLDB |
6.5903145e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 5,215 |
Relational Approach for Shortest Path Discovery over Large Graphs |
2012 |
VLDB |
5.6228603e-05 |
| 6,978 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
4.8752317e-05 |
Semantically Similar Papers