Back to papers
K-Reach: Who is in Your Small World
Summary: K-Reach is a simple, easy-to-build index for answering k-hop reachability queries in directed graphs. Experiments show it outperforms state-of-the-art reachability indexes and remains efficient for both classic and k-hop queries.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 10367
- Venue
- VLDB
- Year
- 2012
- Pagerank
- 8.1614818e-05
- Overall Rank
- 2,762 | 80.81%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,021 |
Path Problems in Temporal Graphs |
2014 |
VLDB |
0.00014608331 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 1,665 |
The More the Merrier: Efficient Multi-Source Graph Traversal |
2015 |
VLDB |
0.00010958779 |
| 1,776 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.0001058029 |
| 1,843 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010340277 |
| 1,879 |
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph |
2013 |
SIGMOD |
0.00010227906 |
| 3,235 |
iBFS: Concurrent Breadth-First Search on GPUs |
2016 |
SIGMOD |
7.3298263e-05 |
| 3,676 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8500097e-05 |
| 4,207 |
Querying Big Graphs within Bounded Resources |
2014 |
SIGMOD |
6.3519481e-05 |
| 5,488 |
Microblog Entity Linking with Social Temporal Context |
2015 |
SIGMOD |
5.4798261e-05 |
| 8,666 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.467539e-05 |
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.
Semantically Similar Papers