Towards Generating Hop-constrained s-t Simple Path Graphs
Summary: Formalizes k-hop-constrained s-t simple path graphs; NP-hard on directed graphs. Proposes EVE, essential-vertex pruning to yield upper-bound graph in O(k^2|E|), verify rest for exact results; experiments on 15 networks show major speedups over baselines and boost hop-constrained path enumeration. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuzheng Cai (Fudan University)
- 2. Siyuan Liu (Fudan University)
- 3. Weiguo Zheng (Fudan University)
- 4. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{cai_sigmod23,
title = {{Towards Generating Hop-constrained s-t Simple Path Graphs}},
author = {Cai, Yuzheng and Liu, Siyuan and Zheng, Weiguo and Lin, Xuemin},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588915},
url = {https://dl.acm.org/doi/10.1145/3588915},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,397 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 5.3385249e-05 |
| 10,261 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 5.0480912e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 937 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00012971451 |
| 1,563 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010219537 |
| 2,593 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 8.2429717e-05 |
| 2,606 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.2264537e-05 |
| 4,637 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB | 6.4902365e-05 |
| 5,897 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.952769e-05 |
| 6,047 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD | 5.9026722e-05 |
| 6,180 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB | 5.8570846e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,567 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 2 | 3,611 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 3 | 4,606 | Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs | 2014 | VLDB |
| 4 | 5,664 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 6 | 8,397 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD |
| 7 | 3,485 | On k-Path Covers and their Applications | 2014 | VLDB |
| 8 | 7,250 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 9 | 6,047 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD |
| 10 | 4,637 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB |