Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale
Summary: Proposes a hybrid search paradigm and divide-and-conquer distributed algorithm for HC-s-t path enumeration on billion-scale graphs, with pruning and bounded memory to enable high parallelism. Adds idle-machine load balancing and bidirectional search to boost efficiency; experiments demonstrate scalable performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kongzhang Hao
- 2. Long Yuan
- 3. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,089 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.39898e-05 |
| 10,163 | Enumerating Graph Pattern Matches with ML Oracles | 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 |
| 11,038 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next