Back to papers
Hub Labeling for Shortest Path Counting
Summary: Hub labeling for counting shortest paths via hub pushing; index size reduced by graph-reduction techniques. Theoretical results for select graph classes; empirical study shows query times in hundreds of microseconds on graphs with hundreds of millions of edges.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5953
- Venue
- SIGMOD
- Year
- 2020
- Pagerank
- 5.2620152e-05
- Overall Rank
- 5,933 | 58.77%
- DOI
-
10.1145/3318464.3389737
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030020929 |
| 302 |
BLINKS: Ranked Keyword Searches on Graphs |
2007 |
SIGMOD |
0.00028343691 |
| 377 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00025074538 |
| 1,385 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012259478 |
| 1,572 |
Query Preserving Graph Compression |
2012 |
SIGMOD |
0.00011296109 |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |
| 1,694 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010870205 |
| 1,822 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010404349 |
| 1,843 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010340277 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 4,070 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4739921e-05 |
| 7,271 |
Exact Top-k Nearest Keyword Search in Large Networks |
2015 |
SIGMOD |
4.7764555e-05 |
| 7,313 |
Nearest Keyword Search in XML Documents |
2011 |
SIGMOD |
4.7599924e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 1,843 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010340277 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 10,592 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,524 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 1,822 |
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks |
2014 |
VLDB |
0.00010404349 |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030020929 |
| 1,385 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012259478 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |